./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_normal_file-31.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 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:23:17,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:23:17,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:23:17,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:23:17,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:23:17,230 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:23:17,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:23:17,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:23:17,231 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:23:17,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:23:17,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:23:17,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:23:17,235 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:23:17,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:23:17,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:23:17,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:23:17,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:23:17,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:23:17,236 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:23:17,237 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:23:17,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:23:17,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:23:17,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:23:17,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:23:17,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:23:17,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:23:17,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:23:17,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:23:17,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:23:17,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:23:17,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:23:17,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:23:17,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:17,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:23:17,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:23:17,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:23:17,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:23:17,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:23:17,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:23:17,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:23:17,245 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:23:17,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:23:17,250 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 -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-11-19 00:23:17,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:23:17,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:23:17,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:23:17,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:23:17,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:23:17,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:18,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:23:18,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:23:18,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:18,923 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33518a296/ac26530693f0424cab45e2f065f53f0f/FLAG5972622f8 [2024-11-19 00:23:18,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33518a296/ac26530693f0424cab45e2f065f53f0f [2024-11-19 00:23:18,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:23:18,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:23:18,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:18,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:23:18,948 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:23:18,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:18" (1/1) ... [2024-11-19 00:23:18,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6326e273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:18, skipping insertion in model container [2024-11-19 00:23:18,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:18" (1/1) ... [2024-11-19 00:23:18,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:23:19,086 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_normal_file-31.i[913,926] [2024-11-19 00:23:19,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:19,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:23:19,135 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_normal_file-31.i[913,926] [2024-11-19 00:23:19,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:19,171 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:23:19,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19 WrapperNode [2024-11-19 00:23:19,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:19,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:19,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:23:19,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:23:19,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,219 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-19 00:23:19,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:19,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:23:19,219 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:23:19,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:23:19,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,238 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:23:19,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,254 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,258 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:23:19,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:23:19,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:23:19,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:23:19,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (1/1) ... [2024-11-19 00:23:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:19,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:19,304 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-19 00:23:19,306 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-19 00:23:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:23:19,340 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:23:19,340 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:23:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:23:19,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:23:19,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:23:19,400 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:23:19,402 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:23:19,620 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 00:23:19,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:23:19,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:23:19,635 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:23:19,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:19 BoogieIcfgContainer [2024-11-19 00:23:19,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:23:19,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:23:19,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:23:19,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:23:19,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:23:18" (1/3) ... [2024-11-19 00:23:19,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57558c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:19, skipping insertion in model container [2024-11-19 00:23:19,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:19" (2/3) ... [2024-11-19 00:23:19,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57558c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:19, skipping insertion in model container [2024-11-19 00:23:19,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:19" (3/3) ... [2024-11-19 00:23:19,643 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:19,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:23:19,657 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:23:19,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:23:19,718 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;@2d49d1c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:23:19,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:23:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:23:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 00:23:19,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:19,733 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:23:19,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:19,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -297880325, now seen corresponding path program 1 times [2024-11-19 00:23:19,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:23:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621285051] [2024-11-19 00:23:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:19,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:23:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:19,981 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:23:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:23:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621285051] [2024-11-19 00:23:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621285051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:23:19,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:23:19,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:23:19,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338826004] [2024-11-19 00:23:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:23:19,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:23:19,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:23:20,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:23:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:23:20,014 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:20,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:20,039 INFO L93 Difference]: Finished difference Result 83 states and 139 transitions. [2024-11-19 00:23:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:23:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-19 00:23:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:20,048 INFO L225 Difference]: With dead ends: 83 [2024-11-19 00:23:20,048 INFO L226 Difference]: Without dead ends: 41 [2024-11-19 00:23:20,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-19 00:23:20,053 INFO L432 NwaCegarLoop]: 59 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, 59 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-19 00:23:20,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:23:20,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-19 00:23:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-19 00:23:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:23:20,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 59 transitions. [2024-11-19 00:23:20,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 59 transitions. Word has length 74 [2024-11-19 00:23:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:20,092 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 59 transitions. [2024-11-19 00:23:20,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2024-11-19 00:23:20,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 00:23:20,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:20,094 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:23:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 00:23:20,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1477127037, now seen corresponding path program 1 times [2024-11-19 00:23:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:23:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280070681] [2024-11-19 00:23:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:23:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:23:20,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1484313476] [2024-11-19 00:23:20,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:20,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:23:20,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:20,198 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-19 00:23:20,201 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-19 00:23:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:23:20,311 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:23:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:23:20,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:23:20,407 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:23:20,408 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:23:20,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 00:23:20,610 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-19 00:23:20,615 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 00:23:20,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:23:20,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:23:20 BoogieIcfgContainer [2024-11-19 00:23:20,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:23:20,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:23:20,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:23:20,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:23:20,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:19" (3/4) ... [2024-11-19 00:23:20,667 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:23:20,668 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:23:20,669 INFO L158 Benchmark]: Toolchain (without parser) took 1726.84ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 86.3MB in the beginning and 195.0MB in the end (delta: -108.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:23:20,669 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 159.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:23:20,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.04ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 72.1MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 00:23:20,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.79ms. Allocated memory is still 159.4MB. Free memory was 72.1MB in the beginning and 128.6MB in the end (delta: -56.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 00:23:20,672 INFO L158 Benchmark]: Boogie Preprocessor took 44.18ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 128.5MB in the beginning and 208.4MB in the end (delta: -79.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-19 00:23:20,673 INFO L158 Benchmark]: RCFGBuilder took 371.07ms. Allocated memory is still 239.1MB. Free memory was 208.4MB in the beginning and 191.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:23:20,673 INFO L158 Benchmark]: TraceAbstraction took 1026.58ms. Allocated memory is still 239.1MB. Free memory was 191.6MB in the beginning and 195.0MB in the end (delta: -3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:23:20,673 INFO L158 Benchmark]: Witness Printer took 3.94ms. Allocated memory is still 239.1MB. Free memory is still 195.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:23:20,678 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.30ms. Allocated memory is still 159.4MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.04ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 72.1MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.79ms. Allocated memory is still 159.4MB. Free memory was 72.1MB in the beginning and 128.6MB in the end (delta: -56.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.18ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 128.5MB in the beginning and 208.4MB in the end (delta: -79.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. * RCFGBuilder took 371.07ms. Allocated memory is still 239.1MB. Free memory was 208.4MB in the beginning and 191.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1026.58ms. Allocated memory is still 239.1MB. Free memory was 191.6MB in the beginning and 195.0MB in the end (delta: -3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.94ms. Allocated memory is still 239.1MB. Free memory is still 195.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryDOUBLEComparisonOperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] signed long int var_1_7 = 4; [L27] signed long int var_1_8 = -32; [L28] unsigned char var_1_9 = 64; [L29] unsigned char var_1_12 = 4; [L30] double var_1_13 = 0.97; [L31] double var_1_14 = 32.6; [L32] signed long int last_1_var_1_7 = 4; [L33] double last_1_var_1_13 = 0.97; VAL [isInitial=0, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L92] last_1_var_1_7 = var_1_7 [L93] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=0, var_1_7=4, var_1_8=-32, var_1_9=64] [L79] var_1_6 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L80] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L81] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=-32, var_1_9=64] [L82] var_1_8 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L83] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L84] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L85] var_1_12 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L86] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L87] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_14=163/5, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L88] var_1_14 = __VERIFIER_nondet_double() [L89] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L89] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=64] [L104] RET updateVariables() [L105] CALL step() [L37] COND FALSE !(! (var_1_3 < (var_1_8 * last_1_var_1_7))) [L44] var_1_9 = var_1_12 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=4, var_1_8=268435456, var_1_9=1] [L46] COND FALSE !(var_1_9 < var_1_9) [L49] var_1_7 = (var_1_9 - var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=97/100, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L51] COND FALSE !((var_1_9 + var_1_3) < var_1_9) [L62] var_1_13 = var_1_14 VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=200, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L64] COND TRUE \read(var_1_2) [L65] var_1_1 = ((var_1_3 - var_1_9) - var_1_9) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L105] RET step() [L106] CALL, EXPR property() [L96-L97] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_9) - var_1_9))) : ((var_1_6 && (var_1_3 < var_1_9)) ? (var_1_1 == ((signed long int) var_1_3)) : 1)) && ((var_1_9 < var_1_9) ? (var_1_7 == ((signed long int) (var_1_9 + var_1_9))) : (var_1_7 == ((signed long int) (var_1_9 - var_1_3))))) && ((! (var_1_3 < (var_1_8 * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? (var_1_6 ? (var_1_9 == ((unsigned char) var_1_12)) : 1) : 1) : (var_1_9 == ((unsigned char) var_1_12)))) && (((var_1_9 + var_1_3) < var_1_9) ? ((var_1_2 && var_1_6) ? (var_1_6 ? (var_1_13 == ((double) 0.8)) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) : (var_1_13 == ((double) var_1_14))) ; VAL [\result=0, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12=1, var_1_13=2, var_1_14=2, var_1_1=1073741821, var_1_2=1, var_1_3=1073741823, var_1_6=1, var_1_7=-1073741822, var_1_8=268435456, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 11, 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, 59 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, 59 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 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-19 00:23:20,709 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_normal_file-31.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 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:23:22,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:23:22,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:23:22,757 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:23:22,758 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:23:22,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:23:22,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:23:22,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:23:22,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:23:22,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:23:22,797 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:23:22,797 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:23:22,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:23:22,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:23:22,798 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:23:22,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:23:22,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:23:22,802 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:23:22,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:23:22,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:23:22,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:23:22,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:23:22,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:23:22,803 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:23:22,804 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:23:22,804 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:23:22,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:23:22,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:23:22,805 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:23:22,805 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:23:22,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:23:22,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:23:22,806 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:23:22,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:23:22,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:22,806 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:23:22,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:23:22,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:23:22,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:23:22,807 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:23:22,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:23:22,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:23:22,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:23:22,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:23:22,808 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 -> 9930e7e7388f7dfeb601d848298c3301ebab0d86295164196a4204cce117c042 [2024-11-19 00:23:23,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:23:23,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:23:23,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:23:23,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:23:23,096 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:23:23,097 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:24,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:23:24,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:23:24,712 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:24,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5406693d2/e95e24a5557d44b8b6c5e61f5ab1a567/FLAGb83e7b97a [2024-11-19 00:23:24,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5406693d2/e95e24a5557d44b8b6c5e61f5ab1a567 [2024-11-19 00:23:24,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:23:24,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:23:24,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:24,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:23:24,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:23:24,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:24" (1/1) ... [2024-11-19 00:23:24,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38ef4ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:24, skipping insertion in model container [2024-11-19 00:23:24,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:24" (1/1) ... [2024-11-19 00:23:24,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:23:24,929 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_normal_file-31.i[913,926] [2024-11-19 00:23:24,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:24,980 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:23:24,990 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_normal_file-31.i[913,926] [2024-11-19 00:23:25,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:25,025 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:23:25,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25 WrapperNode [2024-11-19 00:23:25,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:25,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:25,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:23:25,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:23:25,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,065 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-19 00:23:25,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:25,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:23:25,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:23:25,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:23:25,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,090 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:23:25,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,104 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,110 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:23:25,111 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:23:25,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:23:25,114 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:23:25,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (1/1) ... [2024-11-19 00:23:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:25,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:25,140 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-19 00:23:25,142 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-19 00:23:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:23:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:23:25,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:23:25,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:23:25,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:23:25,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:23:25,233 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:23:25,235 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:23:25,439 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-19 00:23:25,440 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:23:25,449 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:23:25,449 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:23:25,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:25 BoogieIcfgContainer [2024-11-19 00:23:25,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:23:25,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:23:25,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:23:25,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:23:25,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:23:24" (1/3) ... [2024-11-19 00:23:25,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de3893d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:25, skipping insertion in model container [2024-11-19 00:23:25,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:25" (2/3) ... [2024-11-19 00:23:25,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@de3893d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:25, skipping insertion in model container [2024-11-19 00:23:25,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:25" (3/3) ... [2024-11-19 00:23:25,461 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-31.i [2024-11-19 00:23:25,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:23:25,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:23:25,548 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:23:25,553 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;@62d77f0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:23:25,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:23:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:23:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 00:23:25,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:25,565 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:23:25,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:25,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:25,570 INFO L85 PathProgramCache]: Analyzing trace with hash -297880325, now seen corresponding path program 1 times [2024-11-19 00:23:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:23:25,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008819415] [2024-11-19 00:23:25,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:25,585 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-19 00:23:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:23:25,588 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-19 00:23:25,589 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-19 00:23:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:25,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:23:25,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-19 00:23:25,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:23:25,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:23:25,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008819415] [2024-11-19 00:23:25,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008819415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:23:25,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:23:25,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:23:25,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072737092] [2024-11-19 00:23:25,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:23:25,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:23:25,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:23:25,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:23:25,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:23:25,794 INFO L87 Difference]: Start difference. First operand has 45 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:25,813 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2024-11-19 00:23:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:23:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-19 00:23:25,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:25,821 INFO L225 Difference]: With dead ends: 82 [2024-11-19 00:23:25,821 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 00:23:25,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 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-19 00:23:25,828 INFO L432 NwaCegarLoop]: 56 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, 56 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-19 00:23:25,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:23:25,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 00:23:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 00:23:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 00:23:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2024-11-19 00:23:25,856 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 74 [2024-11-19 00:23:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:25,857 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2024-11-19 00:23:25,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2024-11-19 00:23:25,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-19 00:23:25,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:25,859 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:23:25,865 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-19 00:23:26,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:23:26,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:26,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1477127037, now seen corresponding path program 1 times [2024-11-19 00:23:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:23:26,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262061139] [2024-11-19 00:23:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:26,062 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-19 00:23:26,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:23:26,065 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-19 00:23:26,066 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-19 00:23:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:26,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:23:26,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-19 00:23:57,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:23:57,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:23:57,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262061139] [2024-11-19 00:23:57,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262061139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:23:57,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:23:57,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 00:23:57,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820424827] [2024-11-19 00:23:57,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:23:57,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 00:23:57,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:23:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 00:23:57,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-19 00:23:57,508 INFO L87 Difference]: Start difference. First operand 40 states and 56 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:58,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:58,876 INFO L93 Difference]: Finished difference Result 113 states and 151 transitions. [2024-11-19 00:23:58,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 00:23:58,877 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-19 00:23:58,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:58,878 INFO L225 Difference]: With dead ends: 113 [2024-11-19 00:23:58,878 INFO L226 Difference]: Without dead ends: 111 [2024-11-19 00:23:58,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2024-11-19 00:23:58,880 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 138 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 00:23:58,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 255 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 00:23:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-19 00:23:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 74. [2024-11-19 00:23:58,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:23:58,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 102 transitions. [2024-11-19 00:23:58,894 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 102 transitions. Word has length 74 [2024-11-19 00:23:58,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:58,895 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 102 transitions. [2024-11-19 00:23:58,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 12 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 00:23:58,895 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 102 transitions. [2024-11-19 00:23:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 00:23:58,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:58,897 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:23:58,902 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-19 00:23:59,097 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-19 00:23:59,098 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:59,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1400200324, now seen corresponding path program 1 times [2024-11-19 00:23:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:23:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564544567] [2024-11-19 00:23:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:59,099 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-19 00:23:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:23:59,101 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-19 00:23:59,101 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-19 00:23:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:59,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 00:23:59,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 00:23:59,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:23:59,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:23:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564544567] [2024-11-19 00:23:59,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564544567] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:23:59,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1933119915] [2024-11-19 00:23:59,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:59,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 00:23:59,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 00:23:59,390 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-19 00:23:59,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-19 00:23:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:59,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 00:23:59,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-19 00:23:59,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:23:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1933119915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:23:59,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:23:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-19 00:23:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143256570] [2024-11-19 00:23:59,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:23:59,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 00:23:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:23:59,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 00:23:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 00:23:59,851 INFO L87 Difference]: Start difference. First operand 74 states and 102 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:24:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:24:00,029 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-19 00:24:00,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 00:24:00,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-11-19 00:24:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:24:00,033 INFO L225 Difference]: With dead ends: 123 [2024-11-19 00:24:00,033 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 00:24:00,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:24:00,034 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:24:00,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 81 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:24:00,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 00:24:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-11-19 00:24:00,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.1666666666666667) internal successors, (63), 54 states have internal predecessors, (63), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-19 00:24:00,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 107 transitions. [2024-11-19 00:24:00,047 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 107 transitions. Word has length 75 [2024-11-19 00:24:00,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:24:00,048 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 107 transitions. [2024-11-19 00:24:00,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 00:24:00,048 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 107 transitions. [2024-11-19 00:24:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 00:24:00,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:24:00,055 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:24:00,062 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-19 00:24:00,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-19 00:24:00,455 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-19 00:24:00,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:24:00,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:24:00,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1398353282, now seen corresponding path program 1 times [2024-11-19 00:24:00,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:24:00,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757868437] [2024-11-19 00:24:00,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:24:00,458 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-19 00:24:00,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:24:00,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:24:00,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 00:24:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:24:00,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:24:00,543 INFO L278 TraceCheckSpWp]: Computing forward predicates...