./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.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-47.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 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:25:20,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:25:20,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:25:20,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:25:20,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:25:20,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:25:20,309 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:25:20,310 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:25:20,310 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:25:20,311 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:25:20,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:25:20,312 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:25:20,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:25:20,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:25:20,313 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:25:20,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:25:20,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:25:20,317 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:25:20,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:25:20,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:25:20,318 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:25:20,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:25:20,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:25:20,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:25:20,318 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:25:20,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:25:20,319 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:25:20,319 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:25:20,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:25:20,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:25:20,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:25:20,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:25:20,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:20,320 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:25:20,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:25:20,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:25:20,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:25:20,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:25:20,321 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:25:20,321 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:25:20,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:25:20,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:25:20,323 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 -> 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 [2024-11-19 00:25:20,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:25:20,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:25:20,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:25:20,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:25:20,554 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:25:20,555 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-47.i [2024-11-19 00:25:21,806 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:25:21,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:25:21,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-19 00:25:21,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77276f08e/86b12177580b4727888d55358bebbb26/FLAG43de729c9 [2024-11-19 00:25:21,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77276f08e/86b12177580b4727888d55358bebbb26 [2024-11-19 00:25:21,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:25:21,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:25:21,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:21,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:25:21,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:25:21,996 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:21" (1/1) ... [2024-11-19 00:25:21,997 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a72c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:21, skipping insertion in model container [2024-11-19 00:25:21,997 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:21" (1/1) ... [2024-11-19 00:25:22,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:25:22,147 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-47.i[913,926] [2024-11-19 00:25:22,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:22,181 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:25:22,205 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-47.i[913,926] [2024-11-19 00:25:22,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:22,242 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:25:22,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22 WrapperNode [2024-11-19 00:25:22,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:22,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:22,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:25:22,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:25:22,249 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:25:22" (1/1) ... [2024-11-19 00:25:22,255 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:25:22" (1/1) ... [2024-11-19 00:25:22,270 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-11-19 00:25:22,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:22,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:25:22,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:25:22,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:25:22,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,291 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:25:22,291 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,291 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:25:22,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:25:22,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:25:22,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:25:22,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (1/1) ... [2024-11-19 00:25:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:22,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:22,337 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:25:22,339 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:25:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:25:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:25:22,377 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:25:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:25:22,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:25:22,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:25:22,432 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:25:22,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:25:22,619 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:25:22,619 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:25:22,630 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:25:22,631 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:25:22,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:22 BoogieIcfgContainer [2024-11-19 00:25:22,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:25:22,637 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:25:22,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:25:22,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:25:22,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:25:21" (1/3) ... [2024-11-19 00:25:22,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5b0d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:22, skipping insertion in model container [2024-11-19 00:25:22,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:22" (2/3) ... [2024-11-19 00:25:22,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5b0d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:22, skipping insertion in model container [2024-11-19 00:25:22,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:22" (3/3) ... [2024-11-19 00:25:22,644 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-47.i [2024-11-19 00:25:22,657 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:25:22,658 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:25:22,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:25:22,708 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;@3eddfff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:25:22,708 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:25:22,711 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:25:22,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 00:25:22,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:22,719 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:25:22,720 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:22,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-19 00:25:22,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:25:22,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780835430] [2024-11-19 00:25:22,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:22,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:25:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:25:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:25:22,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780835430] [2024-11-19 00:25:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780835430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:25:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538674715] [2024-11-19 00:25:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:22,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:25:22,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:22,918 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:25:22,920 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:25:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:23,009 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:25:23,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-19 00:25:23,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:25:23,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538674715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:23,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:25:23,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:25:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110427125] [2024-11-19 00:25:23,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:23,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:25:23,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:25:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:25:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:25:23,086 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:25:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:23,134 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-19 00:25:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:25:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-19 00:25:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:23,143 INFO L225 Difference]: With dead ends: 77 [2024-11-19 00:25:23,143 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 00:25:23,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 66 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:25:23,149 INFO L432 NwaCegarLoop]: 53 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, 53 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:25:23,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:25:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 00:25:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 00:25:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:25:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-19 00:25:23,186 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-19 00:25:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:23,186 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-19 00:25:23,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:25:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-19 00:25:23,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 00:25:23,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:23,192 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:25:23,207 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:25:23,393 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:25:23,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:23,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:23,394 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-19 00:25:23,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:25:23,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703292425] [2024-11-19 00:25:23,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:25:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:25:23,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:25:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:25:23,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:25:23,584 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:25:23,585 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:25:23,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:25:23,590 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-19 00:25:23,626 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:25:23,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:25:23 BoogieIcfgContainer [2024-11-19 00:25:23,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:25:23,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:25:23,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:25:23,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:25:23,629 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:22" (3/4) ... [2024-11-19 00:25:23,631 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:25:23,632 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:25:23,632 INFO L158 Benchmark]: Toolchain (without parser) took 1641.88ms. Allocated memory is still 184.5MB. Free memory was 114.9MB in the beginning and 132.3MB in the end (delta: -17.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:25:23,632 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:25:23,633 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.27ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 155.0MB in the end (delta: -40.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-19 00:25:23,633 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.81ms. Allocated memory is still 184.5MB. Free memory was 155.0MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:25:23,633 INFO L158 Benchmark]: Boogie Preprocessor took 34.26ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:25:23,633 INFO L158 Benchmark]: RCFGBuilder took 325.13ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 136.1MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:25:23,634 INFO L158 Benchmark]: TraceAbstraction took 991.48ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 133.4MB in the end (delta: 1.8MB). Peak memory consumption was 547.9kB. Max. memory is 16.1GB. [2024-11-19 00:25:23,634 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 132.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:25:23,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.27ms. Allocated memory is still 184.5MB. Free memory was 114.7MB in the beginning and 155.0MB in the end (delta: -40.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.81ms. Allocated memory is still 184.5MB. Free memory was 155.0MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.26ms. Allocated memory is still 184.5MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 325.13ms. Allocated memory is still 184.5MB. Free memory was 149.9MB in the beginning and 136.1MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 991.48ms. Allocated memory is still 184.5MB. Free memory was 135.2MB in the beginning and 133.4MB in the end (delta: 1.8MB). Peak memory consumption was 547.9kB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 184.5MB. Free memory was 133.4MB in the beginning and 132.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 24.575; [L23] double var_1_8 = 3.5; [L24] signed char var_1_9 = 16; [L25] signed char var_1_10 = 16; [L26] signed char var_1_11 = 4; [L27] signed long int var_1_12 = 8; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 1; [L30] double var_1_15 = 3.8; [L31] signed long int last_1_var_1_12 = 8; VAL [isInitial=0, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L78] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_8=7/2, var_1_9=16] [L88] RET updateLastVariables() [L89] CALL updateVariables() [L62] var_1_8 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L63] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=16, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L64] var_1_10 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_10 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L65] RET assume_abort_if_not(var_1_10 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L66] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=4, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L67] var_1_11 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L68] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L69] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L70] var_1_13 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L71] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L72] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L73] var_1_14 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L74] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L75] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=16] [L89] RET updateVariables() [L90] CALL step() [L35] COND FALSE !(-4 > last_1_var_1_12) [L40] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L42] unsigned char stepLocal_0 = ! var_1_13; VAL [isInitial=1, last_1_var_1_12=8, stepLocal_0=0, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L43] COND FALSE !(stepLocal_0 || var_1_14) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=19/5, var_1_1=983/40, var_1_9=7] [L50] var_1_15 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L51] COND FALSE !(var_1_15 <= var_1_15) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=983/40, var_1_8=53, var_1_9=7] [L56] COND TRUE var_1_12 > var_1_9 [L57] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return ((((var_1_15 <= var_1_15) ? (((var_1_12 + var_1_12) >= (var_1_12 + var_1_9)) ? (var_1_1 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1) : ((var_1_12 > var_1_9) ? (var_1_1 == ((double) var_1_8)) : 1)) && ((-4 > last_1_var_1_12) ? (((~ last_1_var_1_12) <= last_1_var_1_12) ? (var_1_9 == ((signed char) ((((var_1_10 + var_1_11) < 0 ) ? -(var_1_10 + var_1_11) : (var_1_10 + var_1_11))))) : 1) : (var_1_9 == ((signed char) var_1_10)))) && (((! var_1_13) || var_1_14) ? ((! var_1_14) ? (var_1_12 == ((signed long int) (((((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))) : ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))))) : (var_1_12 == ((signed long int) var_1_9))) : 1)) && (var_1_15 == ((double) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, var_1_10=7, var_1_11=-6, var_1_12=8, var_1_13=1, var_1_14=0, var_1_15=53, var_1_1=53, var_1_8=53, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 53 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 53 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 128 SizeOfPredicates, 0 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 272/288 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:25:23,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.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 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:25:25,476 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:25:25,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:25:25,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:25:25,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:25:25,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:25:25,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:25:25,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:25:25,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:25:25,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:25:25,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:25:25,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:25:25,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:25:25,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:25:25,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:25:25,561 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:25:25,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:25:25,562 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:25:25,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:25:25,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:25:25,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:25:25,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:25:25,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:25:25,565 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:25:25,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:25:25,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:25:25,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:25:25,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:25:25,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:25:25,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:25,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:25:25,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:25:25,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:25:25,571 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:25:25,571 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:25:25,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:25:25,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:25:25,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:25:25,572 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:25:25,572 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 -> 9f263d2bb0fd887b3497edbb0b9adbf8ce75a026e9853764f1c2fe7520ee07e1 [2024-11-19 00:25:25,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:25:25,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:25:25,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:25:25,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:25:25,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:25:25,835 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-47.i [2024-11-19 00:25:27,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:25:27,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:25:27,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-47.i [2024-11-19 00:25:27,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bcc9127/65f5ca0b0fbc49f5891bd9b28f4833d0/FLAG98b48fef5 [2024-11-19 00:25:27,911 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30bcc9127/65f5ca0b0fbc49f5891bd9b28f4833d0 [2024-11-19 00:25:27,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:25:27,915 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:25:27,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:27,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:25:27,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:25:27,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:27" (1/1) ... [2024-11-19 00:25:27,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@635ed5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:27, skipping insertion in model container [2024-11-19 00:25:27,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:25:27" (1/1) ... [2024-11-19 00:25:27,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:25:28,098 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-47.i[913,926] [2024-11-19 00:25:28,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:28,147 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:25:28,159 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-47.i[913,926] [2024-11-19 00:25:28,178 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:25:28,200 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:25:28,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28 WrapperNode [2024-11-19 00:25:28,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:25:28,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:28,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:25:28,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:25:28,209 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:25:28" (1/1) ... [2024-11-19 00:25:28,220 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:25:28" (1/1) ... [2024-11-19 00:25:28,242 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-19 00:25:28,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:25:28,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:25:28,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:25:28,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:25:28,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,259 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,271 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:25:28,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,281 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,292 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,293 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,300 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:25:28,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:25:28,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:25:28,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:25:28,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (1/1) ... [2024-11-19 00:25:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:25:28,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:25:28,329 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:25:28,332 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:25:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:25:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:25:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:25:28,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:25:28,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:25:28,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:25:28,458 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:25:28,461 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:25:28,639 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-19 00:25:28,639 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:25:28,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:25:28,649 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:25:28,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:28 BoogieIcfgContainer [2024-11-19 00:25:28,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:25:28,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:25:28,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:25:28,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:25:28,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:25:27" (1/3) ... [2024-11-19 00:25:28,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:28, skipping insertion in model container [2024-11-19 00:25:28,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:25:28" (2/3) ... [2024-11-19 00:25:28,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a5d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:25:28, skipping insertion in model container [2024-11-19 00:25:28,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:25:28" (3/3) ... [2024-11-19 00:25:28,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-47.i [2024-11-19 00:25:28,668 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:25:28,668 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:25:28,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:25:28,715 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;@43abc589, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:25:28,716 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:25:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:25:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 00:25:28,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:28,726 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:25:28,726 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:28,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:28,731 INFO L85 PathProgramCache]: Analyzing trace with hash 807039418, now seen corresponding path program 1 times [2024-11-19 00:25:28,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:28,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459995202] [2024-11-19 00:25:28,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:28,745 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:25:28,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:28,748 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:25:28,749 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:25:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:28,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:25:28,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 00:25:28,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:25:28,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:25:28,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459995202] [2024-11-19 00:25:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459995202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:25:28,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:25:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:25:28,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158273753] [2024-11-19 00:25:28,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:25:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:25:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:25:28,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:25:28,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:25:28,946 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.4) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:25:28,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:28,969 INFO L93 Difference]: Finished difference Result 77 states and 123 transitions. [2024-11-19 00:25:28,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:25:28,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-11-19 00:25:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:28,977 INFO L225 Difference]: With dead ends: 77 [2024-11-19 00:25:28,977 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 00:25:28,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 64 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:25:28,984 INFO L432 NwaCegarLoop]: 53 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, 53 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:25:28,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:25:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 00:25:29,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 00:25:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:25:29,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-19 00:25:29,021 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 65 [2024-11-19 00:25:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:29,023 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-19 00:25:29,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 00:25:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-19 00:25:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 00:25:29,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:29,026 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:25:29,031 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:25:29,227 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:25:29,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:29,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:29,229 INFO L85 PathProgramCache]: Analyzing trace with hash -81580040, now seen corresponding path program 1 times [2024-11-19 00:25:29,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:29,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531685919] [2024-11-19 00:25:29,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:29,230 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:25:29,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:29,232 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:25:29,233 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:25:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:29,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 00:25:29,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:25:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-19 00:25:30,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 00:25:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-19 00:25:30,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:25:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531685919] [2024-11-19 00:25:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531685919] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 00:25:30,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 00:25:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-19 00:25:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16559074] [2024-11-19 00:25:30,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 00:25:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 00:25:30,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:25:30,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 00:25:30,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:25:30,412 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:25:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:25:30,836 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2024-11-19 00:25:30,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:25:30,838 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65 [2024-11-19 00:25:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:25:30,839 INFO L225 Difference]: With dead ends: 78 [2024-11-19 00:25:30,839 INFO L226 Difference]: Without dead ends: 43 [2024-11-19 00:25:30,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-11-19 00:25:30,841 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 74 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:25:30,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 92 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:25:30,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-19 00:25:30,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-11-19 00:25:30,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-19 00:25:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2024-11-19 00:25:30,851 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 65 [2024-11-19 00:25:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:25:30,852 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2024-11-19 00:25:30,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 4 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (18), 2 states have call predecessors, (18), 4 states have call successors, (18) [2024-11-19 00:25:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2024-11-19 00:25:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 00:25:30,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:25:30,856 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:25:30,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 00:25:31,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:25:31,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:25:31,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:25:31,061 INFO L85 PathProgramCache]: Analyzing trace with hash -316154374, now seen corresponding path program 1 times [2024-11-19 00:25:31,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:25:31,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943012875] [2024-11-19 00:25:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:25:31,061 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:25:31,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:25:31,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:25:31,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:25:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:25:31,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 00:25:31,134 INFO L278 TraceCheckSpWp]: Computing forward predicates...