./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.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 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:08:07,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:08:07,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:08:07,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:08:07,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:08:07,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:08:07,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:08:07,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:08:07,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:08:07,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:08:07,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:08:07,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:08:07,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:08:07,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:08:07,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:08:07,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:08:07,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:08:07,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:08:07,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:08:07,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:08:07,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:08:07,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:08:07,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:08:07,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:08:07,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:08:07,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:08:07,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:08:07,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:08:07,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:08:07,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:08:07,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:08:07,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:08:07,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:07,827 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:08:07,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:08:07,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:08:07,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:08:07,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:08:07,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:08:07,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:08:07,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:08:07,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:08:07,830 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 -> 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 [2024-10-24 11:08:08,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:08:08,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:08:08,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:08:08,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:08:08,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:08:08,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:09,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:08:09,585 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:08:09,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:09,595 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71a090d2/5246aacd891148109ae0e0718cc22a11/FLAG229bb7711 [2024-10-24 11:08:09,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d71a090d2/5246aacd891148109ae0e0718cc22a11 [2024-10-24 11:08:09,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:08:09,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:08:10,001 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:10,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:08:10,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:08:10,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:09" (1/1) ... [2024-10-24 11:08:10,011 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76710ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10, skipping insertion in model container [2024-10-24 11:08:10,012 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:09" (1/1) ... [2024-10-24 11:08:10,033 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:08:10,164 WARN L248 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-65.i[913,926] [2024-10-24 11:08:10,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:10,213 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:08:10,222 WARN L248 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-65.i[913,926] [2024-10-24 11:08:10,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:10,252 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:08:10,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10 WrapperNode [2024-10-24 11:08:10,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:10,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:10,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:08:10,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:08:10,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,287 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 11:08:10,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:10,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:08:10,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:08:10,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:08:10,304 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,306 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,318 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-10-24 11:08:10,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,319 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:08:10,330 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:08:10,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:08:10,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:08:10,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (1/1) ... [2024-10-24 11:08:10,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:10,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:10,363 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-10-24 11:08:10,367 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-10-24 11:08:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:08:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:08:10,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:08:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:08:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:08:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:08:10,476 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:08:10,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:08:10,675 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:08:10,675 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:08:10,727 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:08:10,728 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:08:10,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:10 BoogieIcfgContainer [2024-10-24 11:08:10,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:08:10,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:08:10,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:08:10,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:08:10,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:08:09" (1/3) ... [2024-10-24 11:08:10,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f585966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:10, skipping insertion in model container [2024-10-24 11:08:10,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:10" (2/3) ... [2024-10-24 11:08:10,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f585966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:10, skipping insertion in model container [2024-10-24 11:08:10,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:10" (3/3) ... [2024-10-24 11:08:10,738 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:10,752 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:08:10,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:08:10,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:08:10,808 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;@6d1af999, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:08:10,808 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:08:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:08:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:08:10,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:10,821 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:08:10,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1684374265, now seen corresponding path program 1 times [2024-10-24 11:08:10,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:10,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172156699] [2024-10-24 11:08:10,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:10,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:08:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:08:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:08:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 11:08:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 11:08:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 11:08:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 11:08:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 11:08:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 11:08:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 11:08:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 11:08:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-24 11:08:11,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:08:11,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172156699] [2024-10-24 11:08:11,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172156699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:11,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:11,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:08:11,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219293541] [2024-10-24 11:08:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:11,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:08:11,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:08:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:08:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:08:11,165 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:08:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:11,205 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2024-10-24 11:08:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:08:11,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2024-10-24 11:08:11,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:11,219 INFO L225 Difference]: With dead ends: 75 [2024-10-24 11:08:11,219 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 11:08:11,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-24 11:08:11,226 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:11,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:08:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 11:08:11,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 11:08:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:08:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2024-10-24 11:08:11,271 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 73 [2024-10-24 11:08:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:11,272 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-10-24 11:08:11,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-24 11:08:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2024-10-24 11:08:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:08:11,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:11,277 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:08:11,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:08:11,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:11,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:11,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968707, now seen corresponding path program 1 times [2024-10-24 11:08:11,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:11,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266085073] [2024-10-24 11:08:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:08:11,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:08:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:08:11,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:08:11,485 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:08:11,487 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:08:11,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:08:11,492 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 11:08:11,562 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:08:11,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:08:11 BoogieIcfgContainer [2024-10-24 11:08:11,566 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:08:11,567 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:08:11,567 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:08:11,568 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:08:11,568 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:10" (3/4) ... [2024-10-24 11:08:11,570 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:08:11,571 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:08:11,573 INFO L158 Benchmark]: Toolchain (without parser) took 1575.76ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 118.2MB in the beginning and 172.5MB in the end (delta: -54.3MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-10-24 11:08:11,573 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:08:11,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.11ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 104.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 11:08:11,575 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.70ms. Allocated memory is still 172.0MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:08:11,575 INFO L158 Benchmark]: Boogie Preprocessor took 41.11ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 99.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:08:11,575 INFO L158 Benchmark]: RCFGBuilder took 399.00ms. Allocated memory is still 172.0MB. Free memory was 99.0MB in the beginning and 81.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 11:08:11,575 INFO L158 Benchmark]: TraceAbstraction took 834.78ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 81.3MB in the beginning and 172.5MB in the end (delta: -91.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:08:11,576 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 239.1MB. Free memory is still 172.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:08:11,577 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.17ms. Allocated memory is still 172.0MB. Free memory is still 141.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.11ms. Allocated memory is still 172.0MB. Free memory was 117.9MB in the beginning and 104.0MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.70ms. Allocated memory is still 172.0MB. Free memory was 104.0MB in the beginning and 101.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.11ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 99.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 399.00ms. Allocated memory is still 172.0MB. Free memory was 99.0MB in the beginning and 81.9MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 834.78ms. Allocated memory was 172.0MB in the beginning and 239.1MB in the end (delta: 67.1MB). Free memory was 81.3MB in the beginning and 172.5MB in the end (delta: -91.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 239.1MB. Free memory is still 172.5MB. 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 88, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 88, overapproximation of someUnaryFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 1000000000.1; [L23] unsigned char var_1_3 = 1; [L24] float var_1_4 = 8.2; [L25] signed long int var_1_5 = -32; [L26] double var_1_9 = 100.5; [L27] double var_1_12 = 25.25; [L28] double var_1_13 = 63.6; [L29] double var_1_14 = 0.0; [L30] double var_1_15 = 0.8; [L31] signed char var_1_16 = -8; [L32] signed char var_1_17 = 8; [L33] unsigned short int var_1_18 = 2; [L34] unsigned short int var_1_19 = 50; [L35] unsigned short int var_1_20 = 0; [L36] double last_1_var_1_9 = 100.5; [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] CALL updateLastVariables() [L85] last_1_var_1_9 = var_1_9 [L95] RET updateLastVariables() [L96] CALL updateVariables() [L64] var_1_3 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L66] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L66] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_4=41/5, var_1_5=-32, var_1_9=201/2] [L67] var_1_4 = __VERIFIER_nondet_float() [L68] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L68] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_12=101/4, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L69] var_1_12 = __VERIFIER_nondet_double() [L70] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L70] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_13=318/5, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L71] var_1_13 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L72] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_14=0, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L73] var_1_14 = __VERIFIER_nondet_double() [L74] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L74] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_15=4/5, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L75] var_1_15 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L76] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=8, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L77] var_1_17 = __VERIFIER_nondet_char() [L78] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L78] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L79] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L79] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=50, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L80] var_1_19 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L81] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L82] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=65534, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=65534, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L82] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=65534, var_1_1=10000000001/10, var_1_20=0, var_1_3=1, var_1_5=-32, var_1_9=201/2] [L96] RET updateVariables() [L97] CALL step() [L40] COND FALSE !(0.625f > last_1_var_1_9) [L45] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=-8, var_1_17=126, var_1_18=2, var_1_19=65534, var_1_1=1000000005, var_1_20=0, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L47] var_1_16 = var_1_17 [L48] var_1_18 = var_1_19 [L49] var_1_20 = var_1_19 VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L50] COND TRUE \read(var_1_3) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=-32, var_1_9=201/2] [L51] COND TRUE var_1_20 >= ((var_1_18 - var_1_20) * 64) [L52] var_1_9 = (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=-32] [L59] COND TRUE var_1_4 > var_1_9 [L60] var_1_5 = (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=196600] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return ((((((0.625f > last_1_var_1_9) ? (var_1_3 ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : 1) : (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4)))))) && ((var_1_4 > var_1_9) ? (var_1_5 == ((signed long int) (((((var_1_20) > (-64)) ? (var_1_20) : (-64))) + ((var_1_20 + -2) + var_1_18)))) : 1)) && (var_1_3 ? ((var_1_20 >= ((var_1_18 - var_1_20) * 64)) ? (var_1_9 == ((double) (((((var_1_12) < (50.5)) ? (var_1_12) : (50.5))) - var_1_13))) : 1) : ((var_1_1 <= var_1_1) ? (var_1_9 == ((double) (var_1_13 - (var_1_14 - var_1_15)))) : 1))) && (var_1_16 == ((signed char) var_1_17))) && (var_1_18 == ((unsigned short int) var_1_19))) && (var_1_20 == ((unsigned short int) var_1_19)) ; [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=196600] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=201/2, var_1_16=126, var_1_17=126, var_1_18=65534, var_1_19=65534, var_1_1=1000000005, var_1_20=65534, var_1_3=1, var_1_4=1000000005, var_1_5=196600] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 50 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 72 ConstructedInterpolants, 0 QuantifiedInterpolants, 72 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 11:08:11,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.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 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:08:13,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:08:13,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:08:13,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:08:13,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:08:13,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:08:13,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:08:13,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:08:13,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:08:13,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:08:13,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:08:13,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:08:13,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:08:13,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:08:13,646 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:08:13,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:08:13,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:08:13,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:08:13,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:08:13,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:08:13,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:08:13,651 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:08:13,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:08:13,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:08:13,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:08:13,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:08:13,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:08:13,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:13,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:08:13,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:08:13,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:08:13,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:08:13,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:08:13,656 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:08:13,656 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 -> 28862f134dfb9731fa78f6a0cfd7be5cd0ae44c8c49bd39e29ecb8fe23dac4e6 [2024-10-24 11:08:13,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:08:13,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:08:13,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:08:13,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:08:13,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:08:13,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:15,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:08:15,490 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:08:15,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:15,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ebfd0e0/5ed6bd6334384693a7f8f39ea4459f7a/FLAG906a04d55 [2024-10-24 11:08:15,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72ebfd0e0/5ed6bd6334384693a7f8f39ea4459f7a [2024-10-24 11:08:15,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:08:15,514 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:08:15,515 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:15,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:08:15,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:08:15,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506be179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15, skipping insertion in model container [2024-10-24 11:08:15,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:08:15,705 WARN L248 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-65.i[913,926] [2024-10-24 11:08:15,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:15,771 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:08:15,782 WARN L248 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-65.i[913,926] [2024-10-24 11:08:15,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:15,812 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:08:15,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15 WrapperNode [2024-10-24 11:08:15,813 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:15,814 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:15,814 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:08:15,814 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:08:15,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,854 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 99 [2024-10-24 11:08:15,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:15,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:08:15,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:08:15,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:08:15,868 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,891 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-10-24 11:08:15,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,918 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:08:15,921 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:08:15,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:08:15,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:08:15,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (1/1) ... [2024-10-24 11:08:15,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:15,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:15,956 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-10-24 11:08:15,961 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-10-24 11:08:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:08:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:08:16,007 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:08:16,007 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:08:16,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:08:16,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:08:16,084 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:08:16,087 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:08:19,910 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 11:08:19,910 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:08:19,975 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:08:19,976 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:08:19,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:19 BoogieIcfgContainer [2024-10-24 11:08:19,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:08:19,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:08:19,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:08:19,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:08:19,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:08:15" (1/3) ... [2024-10-24 11:08:19,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e6ff21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:19, skipping insertion in model container [2024-10-24 11:08:19,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:15" (2/3) ... [2024-10-24 11:08:19,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e6ff21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:19, skipping insertion in model container [2024-10-24 11:08:19,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:19" (3/3) ... [2024-10-24 11:08:19,987 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-65.i [2024-10-24 11:08:20,002 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:08:20,003 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:08:20,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:08:20,073 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;@4bddde63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:08:20,074 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:08:20,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:08:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:08:20,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:20,089 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:08:20,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1684374265, now seen corresponding path program 1 times [2024-10-24 11:08:20,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:08:20,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465632658] [2024-10-24 11:08:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:20,106 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-10-24 11:08:20,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:08:20,108 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-10-24 11:08:20,109 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-10-24 11:08:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:20,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:08:20,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:08:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-24 11:08:20,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:08:20,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:08:20,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465632658] [2024-10-24 11:08:20,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465632658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:08:20,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114510724] [2024-10-24 11:08:20,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:20,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:08:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:08:20,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:08:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:08:20,515 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.44) internal successors, (36), 26 states have internal predecessors, (36), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:08:22,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 11:08:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:22,478 INFO L93 Difference]: Finished difference Result 75 states and 125 transitions. [2024-10-24 11:08:22,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:08:22,503 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2024-10-24 11:08:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:22,509 INFO L225 Difference]: With dead ends: 75 [2024-10-24 11:08:22,509 INFO L226 Difference]: Without dead ends: 37 [2024-10-24 11:08:22,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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-10-24 11:08:22,514 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:22,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 11:08:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-24 11:08:22,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-10-24 11:08:22,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-24 11:08:22,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2024-10-24 11:08:22,543 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 73 [2024-10-24 11:08:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2024-10-24 11:08:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-24 11:08:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2024-10-24 11:08:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-24 11:08:22,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:22,545 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 11:08:22,556 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-10-24 11:08:22,746 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-10-24 11:08:22,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:22,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:22,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1296968707, now seen corresponding path program 1 times [2024-10-24 11:08:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:08:22,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429840950] [2024-10-24 11:08:22,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:22,748 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-10-24 11:08:22,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:08:22,751 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-10-24 11:08:22,752 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-10-24 11:08:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:23,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-24 11:08:23,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:08:57,362 WARN L286 SmtUtils]: Spent 13.28s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)