./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.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 d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:23:44,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:23:44,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:23:44,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:23:44,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:23:44,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:23:44,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:23:44,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:23:44,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:23:44,153 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:23:44,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:23:44,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:23:44,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:23:44,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:23:44,155 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:23:44,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:23:44,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:23:44,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:23:44,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:23:44,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:23:44,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:23:44,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:23:44,161 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:23:44,161 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:23:44,162 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:23:44,162 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:23:44,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:23:44,162 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:23:44,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:23:44,163 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:23:44,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:23:44,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:23:44,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:44,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:23:44,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:23:44,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:23:44,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:23:44,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:23:44,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:23:44,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:23:44,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:23:44,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:23:44,166 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 -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-19 00:23:44,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:23:44,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:23:44,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:23:44,451 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:23:44,452 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:23:44,453 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-34.i [2024-11-19 00:23:45,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:23:46,124 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:23:46,125 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-19 00:23:46,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0147552b2/5a1951838fe04f4fb2bd2f05ea19438d/FLAGce1107422 [2024-11-19 00:23:46,154 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0147552b2/5a1951838fe04f4fb2bd2f05ea19438d [2024-11-19 00:23:46,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:23:46,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:23:46,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:46,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:23:46,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:23:46,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5357dcec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46, skipping insertion in model container [2024-11-19 00:23:46,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:23:46,381 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-34.i[913,926] [2024-11-19 00:23:46,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:46,463 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:23:46,474 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-34.i[913,926] [2024-11-19 00:23:46,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:46,521 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:23:46,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46 WrapperNode [2024-11-19 00:23:46,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:46,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:46,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:23:46,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:23:46,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,571 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-19 00:23:46,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:46,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:23:46,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:23:46,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:23:46,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,610 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:23:46,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,617 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,624 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:23:46,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:23:46,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:23:46,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:23:46,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (1/1) ... [2024-11-19 00:23:46,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:46,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:46,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:23:46,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:23:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:23:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:23:46,735 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:23:46,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:23:46,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:23:46,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:23:46,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:23:46,823 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:23:47,070 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 00:23:47,071 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:23:47,086 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:23:47,087 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:23:47,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:47 BoogieIcfgContainer [2024-11-19 00:23:47,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:23:47,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:23:47,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:23:47,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:23:47,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:23:46" (1/3) ... [2024-11-19 00:23:47,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616fa0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:47, skipping insertion in model container [2024-11-19 00:23:47,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:46" (2/3) ... [2024-11-19 00:23:47,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616fa0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:23:47, skipping insertion in model container [2024-11-19 00:23:47,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:47" (3/3) ... [2024-11-19 00:23:47,097 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-19 00:23:47,113 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:23:47,113 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:23:47,198 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:23:47,206 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;@1b730b4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:23:47,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:23:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:23:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:23:47,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:47,242 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:23:47,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:47,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:47,263 INFO L85 PathProgramCache]: Analyzing trace with hash -343706398, now seen corresponding path program 1 times [2024-11-19 00:23:47,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:23:47,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304864941] [2024-11-19 00:23:47,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:47,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:23:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:47,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-19 00:23:47,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:23:47,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304864941] [2024-11-19 00:23:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304864941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:23:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694162328] [2024-11-19 00:23:47,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:47,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:23:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:47,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 00:23:47,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 00:23:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:47,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:23:47,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:23:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2024-11-19 00:23:47,810 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:23:47,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694162328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:23:47,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:23:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:23:47,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825798883] [2024-11-19 00:23:47,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:23:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:23:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:23:47,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:23:47,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:23:47,846 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:23:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:47,873 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-11-19 00:23:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:23:47,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-19 00:23:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:47,880 INFO L225 Difference]: With dead ends: 115 [2024-11-19 00:23:47,880 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 00:23:47,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:23:47,886 INFO L432 NwaCegarLoop]: 85 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, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:23:47,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:23:47,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 00:23:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 00:23:47,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:23:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2024-11-19 00:23:47,925 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 141 [2024-11-19 00:23:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:47,926 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2024-11-19 00:23:47,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:23:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2024-11-19 00:23:47,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:23:47,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:47,929 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:23:47,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:23:48,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:23:48,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2126183968, now seen corresponding path program 1 times [2024-11-19 00:23:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:23:48,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782784158] [2024-11-19 00:23:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:23:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:23:52,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-19 00:23:52,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:23:52,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782784158] [2024-11-19 00:23:52,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782784158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:23:52,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:23:52,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:23:52,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990057805] [2024-11-19 00:23:52,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:23:52,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:23:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:23:52,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:23:52,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:23:52,637 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:23:53,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:23:53,241 INFO L93 Difference]: Finished difference Result 139 states and 203 transitions. [2024-11-19 00:23:53,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:23:53,242 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-19 00:23:53,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:23:53,245 INFO L225 Difference]: With dead ends: 139 [2024-11-19 00:23:53,248 INFO L226 Difference]: Without dead ends: 85 [2024-11-19 00:23:53,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-11-19 00:23:53,250 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 110 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:23:53,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 284 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:23:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-19 00:23:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2024-11-19 00:23:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:23:53,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2024-11-19 00:23:53,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 141 [2024-11-19 00:23:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:23:53,273 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 94 transitions. [2024-11-19 00:23:53,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:23:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 94 transitions. [2024-11-19 00:23:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:23:53,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:23:53,278 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:23:53,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:23:53,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:23:53,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:23:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1359436702, now seen corresponding path program 1 times [2024-11-19 00:23:53,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:23:53,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284484513] [2024-11-19 00:23:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:23:53,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:23:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:23:53,359 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:23:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:23:53,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:23:53,450 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:23:53,454 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:23:53,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:23:53,459 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 00:23:53,547 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:23:53,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:23:53 BoogieIcfgContainer [2024-11-19 00:23:53,550 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:23:53,550 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:23:53,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:23:53,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:23:53,551 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:23:47" (3/4) ... [2024-11-19 00:23:53,556 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:23:53,557 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:23:53,558 INFO L158 Benchmark]: Toolchain (without parser) took 7398.98ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 122.3MB in the beginning and 57.5MB in the end (delta: 64.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,558 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 121.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:23:53,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.21ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,561 INFO L158 Benchmark]: Boogie Preprocessor took 59.23ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 102.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,562 INFO L158 Benchmark]: RCFGBuilder took 455.36ms. Allocated memory is still 157.3MB. Free memory was 102.0MB in the beginning and 84.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,562 INFO L158 Benchmark]: TraceAbstraction took 6460.06ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 84.1MB in the beginning and 58.5MB in the end (delta: 25.6MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,562 INFO L158 Benchmark]: Witness Printer took 7.07ms. Allocated memory is still 197.1MB. Free memory was 58.5MB in the beginning and 57.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:23:53,567 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.16ms. Allocated memory is still 121.6MB. Free memory is still 83.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.21ms. Allocated memory is still 157.3MB. Free memory was 121.7MB in the beginning and 107.7MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 157.3MB. Free memory was 107.2MB in the beginning and 105.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.23ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 102.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 455.36ms. Allocated memory is still 157.3MB. Free memory was 102.0MB in the beginning and 84.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6460.06ms. Allocated memory was 157.3MB in the beginning and 197.1MB in the end (delta: 39.8MB). Free memory was 84.1MB in the beginning and 58.5MB in the end (delta: 25.6MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 7.07ms. Allocated memory is still 197.1MB. Free memory was 58.5MB in the beginning and 57.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 16.6; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] double var_1_4 = 10.6; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_7 = 1; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 0; [L30] signed char var_1_10 = 10; [L31] unsigned char var_1_11 = 100; [L32] unsigned char var_1_12 = 64; [L33] unsigned char var_1_13 = 100; [L34] signed char var_1_14 = -4; [L35] signed char var_1_15 = 32; [L36] signed char var_1_16 = 4; [L37] signed char var_1_17 = 64; [L38] unsigned char last_1_var_1_5 = 0; VAL [isInitial=0, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L103] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=1, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] RET updateLastVariables() [L114] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_4=53/5, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L73] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L75] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L77] var_1_8 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L78] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_9=0] [L79] CALL assume_abort_if_not(var_1_8 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L79] RET assume_abort_if_not(var_1_8 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L80] var_1_9 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L81] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0] [L82] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L82] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=100, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L84] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_11 <= 128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L85] RET assume_abort_if_not(var_1_11 <= 128) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L86] var_1_12 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_12 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L87] RET assume_abort_if_not(var_1_12 >= 64) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=100, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L89] var_1_13 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L90] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L91] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-4, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L92] var_1_14 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L93] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=32, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L95] var_1_15 = __VERIFIER_nondet_char() [L96] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=4, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_16 = __VERIFIER_nondet_char() [L99] CALL assume_abort_if_not(var_1_16 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_16 >= -127) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L114] RET updateVariables() [L115] CALL step() [L42] COND FALSE !(\read(last_1_var_1_5)) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L47] COND FALSE !(var_1_1 >= (- (var_1_4 * var_1_1))) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=0, var_1_7=1, var_1_8=0, var_1_9=0] [L50] COND TRUE var_1_3 || (256 >= (var_1_17 + 4)) [L51] var_1_5 = ((var_1_2 || var_1_3) || var_1_7) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L55] signed long int stepLocal_1 = (var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1))); [L56] signed char stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_5=0, stepLocal_0=64, stepLocal_1=126, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L57] COND FALSE !(-10 >= stepLocal_0) VAL [isInitial=1, last_1_var_1_5=0, stepLocal_1=126, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L115] RET step() [L116] CALL, EXPR property() [L106-L107] return (((last_1_var_1_5 ? (last_1_var_1_5 ? (var_1_1 == ((double) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : 1) && ((var_1_3 || (256 >= (var_1_17 + 4))) ? (var_1_5 == ((unsigned char) ((var_1_2 || var_1_3) || var_1_7))) : (var_1_5 == ((unsigned char) (! (! (var_1_8 || var_1_9))))))) && ((-10 >= var_1_17) ? ((((var_1_11 + var_1_12) - ((((var_1_13) < (1)) ? (var_1_13) : (1)))) > (~ var_1_17)) ? (var_1_10 == ((signed char) (var_1_14 + var_1_15))) : (var_1_10 == ((signed char) var_1_16))) : 1)) && ((var_1_1 >= (- (var_1_4 * var_1_1))) ? (var_1_17 == ((signed char) var_1_15)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=0, var_1_10=10, var_1_11=63, var_1_12=64, var_1_13=1, var_1_14=-63, var_1_15=62, var_1_16=126, var_1_17=64, var_1_1=83/5, var_1_2=0, var_1_3=1, var_1_5=1, var_1_7=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 369 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 209 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 195 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 160 mSDtfsCounter, 195 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 21 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 420 ConstructedInterpolants, 0 QuantifiedInterpolants, 1156 SizeOfPredicates, 0 NumberOfNonLiveVariables, 311 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2992/3036 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 00:23:53,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.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 d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:23:55,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:23:55,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:23:55,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:23:55,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:23:55,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:23:55,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:23:55,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:23:55,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:23:55,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:23:55,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:23:55,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:23:55,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:23:55,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:23:55,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:23:55,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:23:55,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:23:55,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:23:55,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:23:55,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:23:55,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:23:55,846 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:23:55,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:23:55,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:23:55,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:23:55,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:23:55,847 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:23:55,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:23:55,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:23:55,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:23:55,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:23:55,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:23:55,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:23:55,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:23:55,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:55,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:23:55,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:23:55,860 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:23:55,861 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:23:55,862 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:23:55,862 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:23:55,863 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:23:55,863 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:23:55,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:23:55,864 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 -> d207a3be96e10d809a418ec7cf022785a69a037a0643326467989b76bfc83d98 [2024-11-19 00:23:56,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:23:56,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:23:56,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:23:56,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:23:56,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:23:56,207 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-34.i [2024-11-19 00:23:57,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:23:57,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:23:57,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-34.i [2024-11-19 00:23:58,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd7e1356/1cb4cb2ec9984c8b9b6f7f15d06789a4/FLAG3b437867f [2024-11-19 00:23:58,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd7e1356/1cb4cb2ec9984c8b9b6f7f15d06789a4 [2024-11-19 00:23:58,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:23:58,023 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:23:58,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:58,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:23:58,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:23:58,032 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eaa830c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58, skipping insertion in model container [2024-11-19 00:23:58,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:23:58,251 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-34.i[913,926] [2024-11-19 00:23:58,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:58,329 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:23:58,341 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-34.i[913,926] [2024-11-19 00:23:58,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:23:58,392 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:23:58,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58 WrapperNode [2024-11-19 00:23:58,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:23:58,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:58,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:23:58,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:23:58,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,439 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-19 00:23:58,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:23:58,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:23:58,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:23:58,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:23:58,455 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,482 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 00:23:58,482 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,493 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,497 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,498 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:23:58,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:23:58,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:23:58,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:23:58,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (1/1) ... [2024-11-19 00:23:58,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:23:58,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:23:58,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 00:23:58,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 00:23:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:23:58,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:23:58,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:23:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:23:58,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:23:58,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:23:58,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:23:58,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:24:03,512 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-19 00:24:03,513 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:24:03,527 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:24:03,529 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:24:03,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:24:03 BoogieIcfgContainer [2024-11-19 00:24:03,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:24:03,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:24:03,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:24:03,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:24:03,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:23:58" (1/3) ... [2024-11-19 00:24:03,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52231337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:24:03, skipping insertion in model container [2024-11-19 00:24:03,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:23:58" (2/3) ... [2024-11-19 00:24:03,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52231337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:24:03, skipping insertion in model container [2024-11-19 00:24:03,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:24:03" (3/3) ... [2024-11-19 00:24:03,539 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-34.i [2024-11-19 00:24:03,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:24:03,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:24:03,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:24:03,624 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;@4e63ea58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:24:03,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:24:03,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:24:03,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:24:03,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:24:03,637 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:24:03,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:24:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:24:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash -343706398, now seen corresponding path program 1 times [2024-11-19 00:24:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:24:03,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874201092] [2024-11-19 00:24:03,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:24:03,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:24:03,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:24:03,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:24:03,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 00:24:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:24:03,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:24:03,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:24:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-19 00:24:04,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:24:04,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:24:04,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874201092] [2024-11-19 00:24:04,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874201092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:24:04,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:24:04,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:24:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328793609] [2024-11-19 00:24:04,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:24:04,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:24:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:24:04,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:24:04,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:24:04,089 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 36 states have internal predecessors, (46), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:24:04,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:24:04,123 INFO L93 Difference]: Finished difference Result 115 states and 201 transitions. [2024-11-19 00:24:04,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:24:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 141 [2024-11-19 00:24:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:24:04,134 INFO L225 Difference]: With dead ends: 115 [2024-11-19 00:24:04,134 INFO L226 Difference]: Without dead ends: 57 [2024-11-19 00:24:04,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:24:04,140 INFO L432 NwaCegarLoop]: 84 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, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 00:24:04,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:24:04,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-19 00:24:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-11-19 00:24:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-19 00:24:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2024-11-19 00:24:04,183 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 141 [2024-11-19 00:24:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:24:04,184 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2024-11-19 00:24:04,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-19 00:24:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2024-11-19 00:24:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 00:24:04,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:24:04,188 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:24:04,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 00:24:04,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:24:04,390 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:24:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:24:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2126183968, now seen corresponding path program 1 times [2024-11-19 00:24:04,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:24:04,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100863619] [2024-11-19 00:24:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:24:04,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:24:04,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:24:04,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:24:04,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 00:24:04,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:24:04,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:24:04,692 INFO L278 TraceCheckSpWp]: Computing forward predicates...