./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.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 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:19:44,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:19:44,102 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:19:44,111 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:19:44,112 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:19:44,155 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:19:44,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:19:44,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:19:44,157 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:19:44,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:19:44,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:19:44,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:19:44,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:19:44,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:19:44,160 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:19:44,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:19:44,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:19:44,161 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:19:44,161 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:19:44,161 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:19:44,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:19:44,165 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:19:44,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:19:44,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:19:44,166 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:19:44,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:19:44,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:19:44,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:19:44,168 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:19:44,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:19:44,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:19:44,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:19:44,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:44,169 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:19:44,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:19:44,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:19:44,172 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:19:44,172 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:19:44,172 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:19:44,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:19:44,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:19:44,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:19:44,174 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 -> 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 [2024-11-09 01:19:44,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:19:44,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:19:44,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:19:44,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:19:44,469 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:19:44,470 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-39.i [2024-11-09 01:19:45,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:19:46,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:19:46,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2024-11-09 01:19:46,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1da66d5/b1ea09318f414483943f1bb76d9bd812/FLAG22afa9531 [2024-11-09 01:19:46,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a1da66d5/b1ea09318f414483943f1bb76d9bd812 [2024-11-09 01:19:46,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:19:46,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:19:46,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:46,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:19:46,071 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:19:46,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d61b82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46, skipping insertion in model container [2024-11-09 01:19:46,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:19:46,269 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-39.i[913,926] [2024-11-09 01:19:46,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:46,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:19:46,336 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-39.i[913,926] [2024-11-09 01:19:46,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:46,370 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:19:46,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46 WrapperNode [2024-11-09 01:19:46,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:46,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:46,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:19:46,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:19:46,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,417 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-09 01:19:46,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:46,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:19:46,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:19:46,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:19:46,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,444 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-09 01:19:46,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,459 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:19:46,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:19:46,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:19:46,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:19:46,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (1/1) ... [2024-11-09 01:19:46,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:46,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:19:46,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:19:46,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:19:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:19:46,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:19:46,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:19:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:19:46,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:19:46,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:19:46,661 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:19:46,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:19:46,936 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-09 01:19:46,936 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:19:46,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:19:46,952 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:19:46,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:46 BoogieIcfgContainer [2024-11-09 01:19:46,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:19:46,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:19:46,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:19:46,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:19:46,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:19:46" (1/3) ... [2024-11-09 01:19:46,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad8ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:46, skipping insertion in model container [2024-11-09 01:19:46,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:46" (2/3) ... [2024-11-09 01:19:46,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad8ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:46, skipping insertion in model container [2024-11-09 01:19:46,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:46" (3/3) ... [2024-11-09 01:19:46,961 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-39.i [2024-11-09 01:19:46,977 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:19:46,977 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:19:47,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:19:47,035 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;@4b084253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:19:47,036 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:19:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:19:47,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:19:47,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:47,052 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:47,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:47,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1022214242, now seen corresponding path program 1 times [2024-11-09 01:19:47,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:47,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828076105] [2024-11-09 01:19:47,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:47,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:19:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:19:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:19:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:19:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:19:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:19:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:19:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:19:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:19:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:19:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:19:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:19:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:19:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:19:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:19:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:19:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:47,447 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:19:47,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:19:47,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828076105] [2024-11-09 01:19:47,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828076105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:47,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761048350] [2024-11-09 01:19:47,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:19:47,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:19:47,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:19:47,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:47,483 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:19:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:47,507 INFO L93 Difference]: Finished difference Result 105 states and 172 transitions. [2024-11-09 01:19:47,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:19:47,510 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-11-09 01:19:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:47,517 INFO L225 Difference]: With dead ends: 105 [2024-11-09 01:19:47,517 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 01:19:47,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:47,524 INFO L432 NwaCegarLoop]: 74 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, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:47,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:19:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 01:19:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 01:19:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:19:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-11-09 01:19:47,570 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 104 [2024-11-09 01:19:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:47,572 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-11-09 01:19:47,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:19:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-11-09 01:19:47,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 01:19:47,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:47,577 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:47,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:19:47,578 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:47,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 860814698, now seen corresponding path program 1 times [2024-11-09 01:19:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850918206] [2024-11-09 01:19:47,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:47,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:19:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:19:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:19:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 01:19:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 01:19:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 01:19:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 01:19:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 01:19:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 01:19:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 01:19:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 01:19:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 01:19:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 01:19:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 01:19:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 01:19:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 01:19:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-09 01:19:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:19:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850918206] [2024-11-09 01:19:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850918206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:19:48,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318450774] [2024-11-09 01:19:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:48,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 01:19:48,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:19:48,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 01:19:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 01:19:48,796 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:19:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:49,097 INFO L93 Difference]: Finished difference Result 121 states and 170 transitions. [2024-11-09 01:19:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 01:19:49,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2024-11-09 01:19:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:49,101 INFO L225 Difference]: With dead ends: 121 [2024-11-09 01:19:49,103 INFO L226 Difference]: Without dead ends: 72 [2024-11-09 01:19:49,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:19:49,105 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 43 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:49,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 206 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:19:49,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-09 01:19:49,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2024-11-09 01:19:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:19:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-11-09 01:19:49,124 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 104 [2024-11-09 01:19:49,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:49,126 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-11-09 01:19:49,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-09 01:19:49,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-11-09 01:19:49,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 01:19:49,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:49,132 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:19:49,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:49,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash 88952805, now seen corresponding path program 1 times [2024-11-09 01:19:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:19:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973379772] [2024-11-09 01:19:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:19:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:19:49,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:19:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:19:49,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:19:49,282 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:19:49,283 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:19:49,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:19:49,289 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 01:19:49,371 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:19:49,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:19:49 BoogieIcfgContainer [2024-11-09 01:19:49,377 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:19:49,378 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:19:49,378 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:19:49,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:19:49,379 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:46" (3/4) ... [2024-11-09 01:19:49,382 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:19:49,383 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:19:49,385 INFO L158 Benchmark]: Toolchain (without parser) took 3321.16ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 129.1MB in the beginning and 107.1MB in the end (delta: 22.0MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,386 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:19:49,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.55ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 114.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.70ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,387 INFO L158 Benchmark]: Boogie Preprocessor took 45.55ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,387 INFO L158 Benchmark]: RCFGBuilder took 484.97ms. Allocated memory is still 184.5MB. Free memory was 109.6MB in the beginning and 93.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,391 INFO L158 Benchmark]: TraceAbstraction took 2421.95ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 92.5MB in the beginning and 108.1MB in the end (delta: -15.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-11-09 01:19:49,391 INFO L158 Benchmark]: Witness Printer took 5.31ms. Allocated memory is still 253.8MB. Free memory was 108.1MB in the beginning and 107.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:19:49,392 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.20ms. Allocated memory is still 184.5MB. Free memory is still 152.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.55ms. Allocated memory is still 184.5MB. Free memory was 128.7MB in the beginning and 114.3MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.70ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.55ms. Allocated memory is still 184.5MB. Free memory was 112.0MB in the beginning and 109.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 484.97ms. Allocated memory is still 184.5MB. Free memory was 109.6MB in the beginning and 93.1MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2421.95ms. Allocated memory was 184.5MB in the beginning and 253.8MB in the end (delta: 69.2MB). Free memory was 92.5MB in the beginning and 108.1MB in the end (delta: -15.7MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 5.31ms. Allocated memory is still 253.8MB. Free memory was 108.1MB in the beginning and 107.1MB in the end (delta: 1.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 someBinaryFLOATComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -5; [L23] signed short int var_1_2 = 0; [L24] signed short int var_1_3 = 1000; [L25] signed short int var_1_4 = 10; [L26] signed short int var_1_5 = 32; [L27] signed long int var_1_6 = 5; [L28] float var_1_7 = 1.1; [L29] float var_1_8 = 7.8; [L30] float var_1_9 = 1.75; [L31] signed long int var_1_10 = 32; [L32] unsigned char var_1_11 = 64; [L33] signed long int var_1_12 = 1230482582; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_short() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] CALL assume_abort_if_not(var_1_2 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L62] RET assume_abort_if_not(var_1_2 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=1000, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L63] var_1_3 = __VERIFIER_nondet_short() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L65] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=10, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L66] var_1_4 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L67] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L68] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=32, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L69] var_1_5 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L70] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L71] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_7=11/10, var_1_8=39/5, var_1_9=7/4] [L72] var_1_7 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L73] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_8=39/5, var_1_9=7/4] [L74] var_1_8 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_9=7/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_9=7/4] [L75] RET assume_abort_if_not((var_1_8 >= -922337.2036854776000e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5, var_1_9=7/4] [L76] var_1_9 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L77] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L78] var_1_11 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L79] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L80] CALL assume_abort_if_not(var_1_11 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L80] RET assume_abort_if_not(var_1_11 <= 255) VAL [isInitial=1, var_1_10=32, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_11 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L81] RET assume_abort_if_not(var_1_11 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1230482582, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L82] var_1_12 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_12 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L83] RET assume_abort_if_not(var_1_12 >= 1073741823) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L84] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L84] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-5, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L97] RET updateVariables() [L98] CALL step() [L37] var_1_1 = ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L38] COND TRUE var_1_2 >= var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=5] [L39] COND FALSE !(((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) [L42] var_1_6 = var_1_1 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L47] EXPR var_1_4 << var_1_2 VAL [isInitial=1, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L47] signed long int stepLocal_1 = var_1_6 + (var_1_4 << var_1_2); [L48] signed long int stepLocal_0 = var_1_2 - (var_1_12 - var_1_5); VAL [isInitial=1, stepLocal_0=-1073741823, stepLocal_1=0, var_1_10=32, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L49] COND FALSE !(stepLocal_1 != var_1_5) [L56] var_1_10 = var_1_2 VAL [isInitial=1, stepLocal_0=-1073741823, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L89-L90] return ((var_1_1 == ((signed short int) ((((((16) > (4)) ? (16) : (4))) + var_1_2) - (var_1_3 + ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))))) && ((var_1_2 >= var_1_1) ? ((((((var_1_7 + var_1_8) < 0 ) ? -(var_1_7 + var_1_8) : (var_1_7 + var_1_8))) < var_1_9) ? (var_1_6 == ((signed long int) var_1_3)) : (var_1_6 == ((signed long int) var_1_1))) : (var_1_6 == ((signed long int) var_1_4)))) && (((var_1_6 + (var_1_4 << var_1_2)) != var_1_5) ? (((var_1_3 / var_1_11) < (var_1_2 - (var_1_12 - var_1_5))) ? (var_1_10 == ((signed long int) ((((-256) < (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2)))))))) ? (-256) : (((((var_1_4) < (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))) ? (var_1_4) : (((((var_1_5) > (var_1_2)) ? (var_1_5) : (var_1_2))))))))))) : (var_1_10 == ((signed long int) var_1_4))) : (var_1_10 == ((signed long int) var_1_2))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=1, var_1_12=1073741823, var_1_1=-1, var_1_2=0, var_1_3=17, var_1_4=1, var_1_5=0, var_1_6=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 140 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=2, InterpolantAutomatonStates: 7, 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, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 313 NumberOfCodeBlocks, 313 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 1452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 01:19:49,432 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-39.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 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:19:51,591 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:19:51,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:19:51,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:19:51,686 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:19:51,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:19:51,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:19:51,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:19:51,724 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:19:51,725 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:19:51,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:19:51,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:19:51,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:19:51,728 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:19:51,728 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:19:51,728 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:19:51,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:19:51,729 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:19:51,729 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:19:51,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:19:51,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:19:51,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:19:51,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:19:51,731 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:19:51,732 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:19:51,732 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:19:51,732 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:19:51,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:19:51,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:19:51,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:19:51,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:19:51,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:19:51,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:19:51,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:19:51,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:51,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:19:51,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:19:51,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:19:51,736 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:19:51,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:19:51,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:19:51,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:19:51,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:19:51,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:19:51,738 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 -> 5d39645531c2e289d9f43a5da1a6328789e313cb06da9f811e7841e4f10030f5 [2024-11-09 01:19:52,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:19:52,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:19:52,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:19:52,077 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:19:52,078 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:19:52,079 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-39.i [2024-11-09 01:19:53,570 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:19:53,791 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:19:53,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-39.i [2024-11-09 01:19:53,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205c3183c/f0c0800539af4712a7091dbfb48fc8be/FLAG28b7a97ff [2024-11-09 01:19:53,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205c3183c/f0c0800539af4712a7091dbfb48fc8be [2024-11-09 01:19:53,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:19:53,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:19:53,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:53,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:19:53,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:19:53,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:53" (1/1) ... [2024-11-09 01:19:53,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9f5e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:53, skipping insertion in model container [2024-11-09 01:19:53,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:19:53" (1/1) ... [2024-11-09 01:19:53,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:19:54,036 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-39.i[913,926] [2024-11-09 01:19:54,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:54,112 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:19:54,129 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-39.i[913,926] [2024-11-09 01:19:54,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:19:54,185 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:19:54,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54 WrapperNode [2024-11-09 01:19:54,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:19:54,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:54,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:19:54,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:19:54,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,244 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-09 01:19:54,248 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:19:54,249 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:19:54,249 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:19:54,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:19:54,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,264 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,281 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,306 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-09 01:19:54,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,380 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:19:54,385 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:19:54,385 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:19:54,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:19:54,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (1/1) ... [2024-11-09 01:19:54,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:19:54,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:19:54,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:19:54,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:19:54,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:19:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:19:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:19:54,480 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:19:54,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:19:54,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:19:54,566 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:19:54,569 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:19:55,097 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 01:19:55,097 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:19:55,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:19:55,115 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:19:55,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:55 BoogieIcfgContainer [2024-11-09 01:19:55,116 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:19:55,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:19:55,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:19:55,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:19:55,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:19:53" (1/3) ... [2024-11-09 01:19:55,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2edf5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:55, skipping insertion in model container [2024-11-09 01:19:55,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:19:54" (2/3) ... [2024-11-09 01:19:55,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2edf5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:19:55, skipping insertion in model container [2024-11-09 01:19:55,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:19:55" (3/3) ... [2024-11-09 01:19:55,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-39.i [2024-11-09 01:19:55,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:19:55,146 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:19:55,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:19:55,211 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;@77ee1778, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:19:55,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:19:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:19:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:19:55,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:55,228 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:55,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:55,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1678023097, now seen corresponding path program 1 times [2024-11-09 01:19:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:19:55,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126557868] [2024-11-09 01:19:55,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:55,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:55,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:19:55,252 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:19:55,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:19:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:55,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:19:55,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:19:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-09 01:19:55,569 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:19:55,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:19:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126557868] [2024-11-09 01:19:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126557868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:19:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:19:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:19:55,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38837472] [2024-11-09 01:19:55,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:19:55,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:19:55,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:19:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:19:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:55,598 INFO L87 Difference]: Start difference. First operand has 49 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:19:55,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:19:55,621 INFO L93 Difference]: Finished difference Result 91 states and 152 transitions. [2024-11-09 01:19:55,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:19:55,623 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-11-09 01:19:55,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:19:55,630 INFO L225 Difference]: With dead ends: 91 [2024-11-09 01:19:55,630 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 01:19:55,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:19:55,639 INFO L432 NwaCegarLoop]: 64 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, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:19:55,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:19:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 01:19:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 01:19:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-09 01:19:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 64 transitions. [2024-11-09 01:19:55,675 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 64 transitions. Word has length 101 [2024-11-09 01:19:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:19:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 64 transitions. [2024-11-09 01:19:55,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-09 01:19:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 64 transitions. [2024-11-09 01:19:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 01:19:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:19:55,679 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:19:55,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 01:19:55,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:55,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:19:55,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:19:55,882 INFO L85 PathProgramCache]: Analyzing trace with hash 852212145, now seen corresponding path program 1 times [2024-11-09 01:19:55,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:19:55,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110578958] [2024-11-09 01:19:55,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:19:55,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:19:55,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:19:55,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:19:55,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:19:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:19:56,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 01:19:56,110 INFO L278 TraceCheckSpWp]: Computing forward predicates...