./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-28.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 6b50568a5bee6511b42bf1cf0968d7f09eeaeacd32170fa25aff7f8f1a2e83cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:57:05,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:57:05,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:57:05,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:57:05,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:57:05,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:57:05,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:57:05,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:57:05,594 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:57:05,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:57:05,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:57:05,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:57:05,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:57:05,597 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:57:05,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:57:05,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:57:05,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:57:05,600 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:57:05,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:57:05,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:57:05,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:57:05,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:57:05,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:57:05,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:57:05,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:57:05,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:57:05,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:57:05,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:57:05,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:57:05,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:57:05,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:57:05,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:57:05,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:05,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:57:05,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:57:05,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:57:05,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:57:05,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:57:05,610 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:57:05,610 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:57:05,610 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:57:05,610 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:57:05,610 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 -> 6b50568a5bee6511b42bf1cf0968d7f09eeaeacd32170fa25aff7f8f1a2e83cf [2024-11-12 06:57:05,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:57:05,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:57:05,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:57:05,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:57:05,909 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:57:05,911 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-28.i [2024-11-12 06:57:07,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:57:07,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:57:07,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-28.i [2024-11-12 06:57:07,672 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715276bd7/87183493897e4c4aac89b124272c94b2/FLAG5999c2de2 [2024-11-12 06:57:07,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715276bd7/87183493897e4c4aac89b124272c94b2 [2024-11-12 06:57:07,690 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:57:07,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:57:07,698 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:07,699 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:57:07,705 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:57:07,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:07" (1/1) ... [2024-11-12 06:57:07,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebb644b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:07, skipping insertion in model container [2024-11-12 06:57:07,710 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:07" (1/1) ... [2024-11-12 06:57:07,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:57:07,952 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-28.i[913,926] [2024-11-12 06:57:08,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:08,031 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:57:08,043 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-28.i[913,926] [2024-11-12 06:57:08,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:08,105 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:57:08,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08 WrapperNode [2024-11-12 06:57:08,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:08,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:08,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:57:08,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:57:08,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,180 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-12 06:57:08,181 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:08,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:57:08,182 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:57:08,182 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:57:08,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,218 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-12 06:57:08,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:57:08,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:57:08,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:57:08,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:57:08,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (1/1) ... [2024-11-12 06:57:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:57:08,289 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-12 06:57:08,297 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-12 06:57:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:57:08,349 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:57:08,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:57:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:57:08,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:57:08,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:57:08,438 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:57:08,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:57:08,770 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 06:57:08,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:57:08,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:57:08,793 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:57:08,793 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:08 BoogieIcfgContainer [2024-11-12 06:57:08,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:57:08,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:57:08,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:57:08,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:57:08,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:57:07" (1/3) ... [2024-11-12 06:57:08,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2665b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:08, skipping insertion in model container [2024-11-12 06:57:08,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:08" (2/3) ... [2024-11-12 06:57:08,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2665b306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:08, skipping insertion in model container [2024-11-12 06:57:08,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:08" (3/3) ... [2024-11-12 06:57:08,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-28.i [2024-11-12 06:57:08,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:57:08,825 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:57:08,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:57:08,919 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;@5b89072d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:57:08,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:57:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:57:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 06:57:08,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:08,939 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:57:08,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:08,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -645560621, now seen corresponding path program 1 times [2024-11-12 06:57:08,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:57:08,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342360600] [2024-11-12 06:57:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:57:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:57:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 06:57:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 06:57:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:57:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:57:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:57:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:57:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:57:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:57:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 06:57:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 06:57:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 06:57:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 06:57:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:57:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:57:09,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:57:09,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342360600] [2024-11-12 06:57:09,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342360600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:57:09,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:57:09,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:57:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733101085] [2024-11-12 06:57:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:57:09,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:57:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:57:09,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:57:09,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:57:09,430 INFO L87 Difference]: Start difference. First operand has 56 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:57:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:57:09,455 INFO L93 Difference]: Finished difference Result 105 states and 168 transitions. [2024-11-12 06:57:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:57:09,458 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2024-11-12 06:57:09,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:57:09,465 INFO L225 Difference]: With dead ends: 105 [2024-11-12 06:57:09,466 INFO L226 Difference]: Without dead ends: 52 [2024-11-12 06:57:09,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-12 06:57:09,473 INFO L435 NwaCegarLoop]: 71 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, 71 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-12 06:57:09,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:57:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-12 06:57:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-12 06:57:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:57:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2024-11-12 06:57:09,517 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 96 [2024-11-12 06:57:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:57:09,517 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2024-11-12 06:57:09,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:57:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2024-11-12 06:57:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-12 06:57:09,522 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:09,522 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:57:09,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:57:09,523 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:09,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 668714771, now seen corresponding path program 1 times [2024-11-12 06:57:09,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:57:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373235922] [2024-11-12 06:57:09,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:57:09,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:57:09,673 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:57:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:57:09,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:57:09,809 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:57:09,810 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:57:09,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:57:09,816 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:57:09,906 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:57:09,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:57:09 BoogieIcfgContainer [2024-11-12 06:57:09,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:57:09,911 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:57:09,911 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:57:09,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:57:09,912 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:08" (3/4) ... [2024-11-12 06:57:09,915 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:57:09,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:57:09,917 INFO L158 Benchmark]: Toolchain (without parser) took 2224.97ms. Allocated memory is still 182.5MB. Free memory was 116.1MB in the beginning and 75.3MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-12 06:57:09,917 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 107.0MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:57:09,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.22ms. Allocated memory is still 182.5MB. Free memory was 115.9MB in the beginning and 155.0MB in the end (delta: -39.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-12 06:57:09,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.67ms. Allocated memory is still 182.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-12 06:57:09,918 INFO L158 Benchmark]: Boogie Preprocessor took 59.46ms. Allocated memory is still 182.5MB. Free memory was 152.9MB in the beginning and 150.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:57:09,919 INFO L158 Benchmark]: RCFGBuilder took 551.56ms. Allocated memory is still 182.5MB. Free memory was 150.1MB in the beginning and 133.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 06:57:09,920 INFO L158 Benchmark]: TraceAbstraction took 1113.01ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 75.3MB in the end (delta: 57.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-12 06:57:09,923 INFO L158 Benchmark]: Witness Printer took 5.03ms. Allocated memory is still 182.5MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:57:09,925 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 107.0MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.22ms. Allocated memory is still 182.5MB. Free memory was 115.9MB in the beginning and 155.0MB in the end (delta: -39.1MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.67ms. Allocated memory is still 182.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 59.46ms. Allocated memory is still 182.5MB. Free memory was 152.9MB in the beginning and 150.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 551.56ms. Allocated memory is still 182.5MB. Free memory was 150.1MB in the beginning and 133.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1113.01ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 75.3MB in the end (delta: 57.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Witness Printer took 5.03ms. Allocated memory is still 182.5MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] float var_1_2 = 63.75; [L24] float var_1_3 = 255.75; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] float var_1_8 = 4.75; [L29] float var_1_9 = 99.5; [L30] float var_1_10 = 255.9; [L31] float var_1_11 = 24.85; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_15 = 1928642731; [L35] signed short int var_1_18 = 0; [L36] unsigned short int var_1_19 = 5; VAL [isInitial=0, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=255/4, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] FCALL updateLastVariables() [L95] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_float() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_3=1023/4, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L64] var_1_5 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L65] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L66] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L67] var_1_6 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L68] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L69] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L69] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=-10, var_1_8=19/4, var_1_9=199/2] [L70] var_1_7 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L71] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L72] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L72] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4, var_1_9=199/2] [L73] var_1_9 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L74] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2559/10, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L75] var_1_10 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L76] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L77] var_1_13 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L78] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L79] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L79] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L80] var_1_15 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L81] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L82] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L82] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L95] RET updateVariables() [L96] CALL step() [L40] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=19/4] [L41] COND TRUE stepLocal_0 < var_1_6 [L42] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=497/20, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L44] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L45] var_1_18 = var_1_5 [L46] var_1_19 = var_1_6 VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=1, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L47] COND TRUE (var_1_2 - var_1_3) <= (- var_1_8) [L48] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L52] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L52] signed long int stepLocal_1 = var_1_6 | 5; [L53] COND TRUE stepLocal_1 <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))) [L54] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L87-L88] return (((((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((float) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19)))))) && (var_1_18 == ((signed short int) var_1_5))) && (var_1_19 == ((unsigned short int) var_1_6)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483651, var_1_11=2147483651, var_1_12=-2147483520, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=0, var_1_1=4, var_1_5=126, var_1_6=0, var_1_7=4, var_1_8=2147483651, var_1_9=2147483651] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, 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, 71 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, 71 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 95 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-12 06:57:09,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-28.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 6b50568a5bee6511b42bf1cf0968d7f09eeaeacd32170fa25aff7f8f1a2e83cf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:57:12,349 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:57:12,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:57:12,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:57:12,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:57:12,485 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:57:12,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:57:12,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:57:12,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:57:12,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:57:12,490 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:57:12,490 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:57:12,491 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:57:12,491 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:57:12,492 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:57:12,492 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:57:12,492 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:57:12,493 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:57:12,493 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:57:12,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:57:12,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:57:12,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:57:12,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:57:12,500 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:57:12,500 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:57:12,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:57:12,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:57:12,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:57:12,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:57:12,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:57:12,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:57:12,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:57:12,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:57:12,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:57:12,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:12,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:57:12,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:57:12,507 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:57:12,507 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:57:12,508 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:57:12,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:57:12,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:57:12,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:57:12,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:57:12,509 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 -> 6b50568a5bee6511b42bf1cf0968d7f09eeaeacd32170fa25aff7f8f1a2e83cf [2024-11-12 06:57:12,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:57:12,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:57:12,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:57:12,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:57:12,895 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:57:12,897 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-28.i [2024-11-12 06:57:14,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:57:14,752 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:57:14,753 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-28.i [2024-11-12 06:57:14,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea6010f7/77a969b613a7463dbe2afe60ef164c0e/FLAG8adb80058 [2024-11-12 06:57:14,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea6010f7/77a969b613a7463dbe2afe60ef164c0e [2024-11-12 06:57:14,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:57:14,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:57:14,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:14,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:57:14,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:57:14,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:14" (1/1) ... [2024-11-12 06:57:14,805 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b701ece and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:14, skipping insertion in model container [2024-11-12 06:57:14,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:57:14" (1/1) ... [2024-11-12 06:57:14,834 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:57:15,060 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-28.i[913,926] [2024-11-12 06:57:15,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:15,144 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:57:15,158 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-28.i[913,926] [2024-11-12 06:57:15,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:57:15,216 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:57:15,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15 WrapperNode [2024-11-12 06:57:15,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:57:15,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:15,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:57:15,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:57:15,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,268 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2024-11-12 06:57:15,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:57:15,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:57:15,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:57:15,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:57:15,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,316 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-12 06:57:15,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,336 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:57:15,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:57:15,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:57:15,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:57:15,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (1/1) ... [2024-11-12 06:57:15,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:57:15,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:57:15,390 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-12 06:57:15,394 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-12 06:57:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:57:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:57:15,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:57:15,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:57:15,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:57:15,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:57:15,531 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:57:15,534 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:57:15,949 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 06:57:15,950 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:57:15,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:57:15,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:57:15,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:15 BoogieIcfgContainer [2024-11-12 06:57:15,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:57:15,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:57:15,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:57:15,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:57:15,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:57:14" (1/3) ... [2024-11-12 06:57:15,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54331e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:15, skipping insertion in model container [2024-11-12 06:57:15,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:57:15" (2/3) ... [2024-11-12 06:57:15,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54331e7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:57:15, skipping insertion in model container [2024-11-12 06:57:15,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:57:15" (3/3) ... [2024-11-12 06:57:15,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-28.i [2024-11-12 06:57:15,997 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:57:15,997 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:57:16,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:57:16,076 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;@427fded7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:57:16,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:57:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:57:16,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 06:57:16,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:16,094 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:57:16,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:16,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2128567644, now seen corresponding path program 1 times [2024-11-12 06:57:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:57:16,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [6066935] [2024-11-12 06:57:16,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:16,134 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-12 06:57:16,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:57:16,138 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-12 06:57:16,139 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-12 06:57:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:16,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:57:16,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:57:16,426 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-12 06:57:16,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:57:16,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:57:16,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [6066935] [2024-11-12 06:57:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [6066935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:57:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:57:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:57:16,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194512695] [2024-11-12 06:57:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:57:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:57:16,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:57:16,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:57:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:57:16,469 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:57:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:57:16,502 INFO L93 Difference]: Finished difference Result 87 states and 140 transitions. [2024-11-12 06:57:16,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:57:16,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2024-11-12 06:57:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:57:16,514 INFO L225 Difference]: With dead ends: 87 [2024-11-12 06:57:16,514 INFO L226 Difference]: Without dead ends: 43 [2024-11-12 06:57:16,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-12 06:57:16,523 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 06:57:16,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:57:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-12 06:57:16,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-12 06:57:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:57:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2024-11-12 06:57:16,578 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 59 transitions. Word has length 93 [2024-11-12 06:57:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:57:16,578 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 59 transitions. [2024-11-12 06:57:16,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:57:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 59 transitions. [2024-11-12 06:57:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-12 06:57:16,585 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:57:16,585 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:57:16,596 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-12 06:57:16,789 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-12 06:57:16,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:57:16,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:57:16,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1087616412, now seen corresponding path program 1 times [2024-11-12 06:57:16,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:57:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148270263] [2024-11-12 06:57:16,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:57:16,794 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-12 06:57:16,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:57:16,798 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-12 06:57:16,800 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-12 06:57:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:57:17,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 06:57:17,037 INFO L279 TraceCheckSpWp]: Computing forward predicates...