./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:01:47,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:01:47,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 09:01:47,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:01:47,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:01:47,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:01:47,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:01:47,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:01:47,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:01:47,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:01:47,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:01:47,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:01:47,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:01:47,303 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:01:47,303 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:01:47,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:01:47,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:01:47,306 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:01:47,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 09:01:47,307 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:01:47,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:01:47,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:01:47,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:01:47,308 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:01:47,308 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:01:47,308 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:01:47,308 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:01:47,309 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:01:47,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:01:47,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:01:47,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:01:47,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:01:47,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:47,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:01:47,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:01:47,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:01:47,311 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 09:01:47,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 09:01:47,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:01:47,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:01:47,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:01:47,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:01:47,318 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2024-11-10 09:01:47,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:01:47,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:01:47,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:01:47,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:01:47,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:01:47,551 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-20.i [2024-11-10 09:01:48,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:01:48,975 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:01:48,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-11-10 09:01:48,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac530098/79ca45903726424d8e593437567b981a/FLAGc8e0cbd7c [2024-11-10 09:01:48,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ac530098/79ca45903726424d8e593437567b981a [2024-11-10 09:01:48,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:01:48,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:01:49,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:49,001 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:01:49,009 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:01:49,009 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:48" (1/1) ... [2024-11-10 09:01:49,010 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e2ecd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49, skipping insertion in model container [2024-11-10 09:01:49,010 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:48" (1/1) ... [2024-11-10 09:01:49,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:01:49,164 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-20.i[913,926] [2024-11-10 09:01:49,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:49,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:01:49,238 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-20.i[913,926] [2024-11-10 09:01:49,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:49,282 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:01:49,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49 WrapperNode [2024-11-10 09:01:49,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:49,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:49,285 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:01:49,285 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:01:49,290 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,334 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 09:01:49,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:49,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:01:49,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:01:49,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:01:49,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,350 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,369 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-10 09:01:49,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,374 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:01:49,382 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:01:49,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:01:49,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:01:49,388 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (1/1) ... [2024-11-10 09:01:49,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:49,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:01:49,417 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-10 09:01:49,419 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-10 09:01:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:01:49,457 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:01:49,457 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:01:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 09:01:49,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:01:49,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:01:49,533 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:01:49,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:01:49,716 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 09:01:49,716 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:01:49,728 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:01:49,729 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:01:49,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:49 BoogieIcfgContainer [2024-11-10 09:01:49,729 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:01:49,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:01:49,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:01:49,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:01:49,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:48" (1/3) ... [2024-11-10 09:01:49,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d2221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:49, skipping insertion in model container [2024-11-10 09:01:49,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:49" (2/3) ... [2024-11-10 09:01:49,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739d2221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:01:49, skipping insertion in model container [2024-11-10 09:01:49,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:49" (3/3) ... [2024-11-10 09:01:49,737 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2024-11-10 09:01:49,750 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:01:49,750 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:01:49,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:01:49,805 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;@7be294b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:01:49,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:01:49,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:01:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 09:01:49,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:49,823 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:49,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:49,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:49,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1815957852, now seen corresponding path program 1 times [2024-11-10 09:01:49,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:01:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589716094] [2024-11-10 09:01:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:49,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:01:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 09:01:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 09:01:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 09:01:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 09:01:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 09:01:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 09:01:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-10 09:01:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-10 09:01:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 09:01:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 09:01:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 09:01:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 09:01:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 09:01:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 09:01:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 09:01:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 09:01:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 09:01:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 09:01:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 09:01:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:01:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-10 09:01:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 09:01:50,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589716094] [2024-11-10 09:01:50,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589716094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:01:50,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:01:50,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:01:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963367461] [2024-11-10 09:01:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:01:50,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:01:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 09:01:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:01:50,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:01:50,149 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:01:50,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:01:50,207 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-10 09:01:50,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:01:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-10 09:01:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:01:50,219 INFO L225 Difference]: With dead ends: 112 [2024-11-10 09:01:50,220 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 09:01:50,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-10 09:01:50,226 INFO L432 NwaCegarLoop]: 78 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, 78 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-10 09:01:50,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:01:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 09:01:50,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 09:01:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:01:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-10 09:01:50,264 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 123 [2024-11-10 09:01:50,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:01:50,265 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-10 09:01:50,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:01:50,265 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-10 09:01:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 09:01:50,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:01:50,268 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:01:50,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 09:01:50,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:01:50,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:01:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash -564304489, now seen corresponding path program 1 times [2024-11-10 09:01:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 09:01:50,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255562342] [2024-11-10 09:01:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:01:50,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 09:01:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:01:50,438 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 09:01:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 09:01:50,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 09:01:50,558 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 09:01:50,559 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 09:01:50,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 09:01:50,564 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 09:01:50,641 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 09:01:50,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:01:50 BoogieIcfgContainer [2024-11-10 09:01:50,645 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 09:01:50,646 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 09:01:50,646 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 09:01:50,646 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 09:01:50,646 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:01:49" (3/4) ... [2024-11-10 09:01:50,649 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 09:01:50,650 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 09:01:50,653 INFO L158 Benchmark]: Toolchain (without parser) took 1651.34ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 71.5MB in the beginning and 122.5MB in the end (delta: -51.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:50,653 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:50,653 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.34ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 111.2MB in the end (delta: -39.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-10 09:01:50,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.17ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 108.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:01:50,656 INFO L158 Benchmark]: Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 09:01:50,656 INFO L158 Benchmark]: IcfgBuilder took 346.96ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 89.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 09:01:50,656 INFO L158 Benchmark]: TraceAbstraction took 914.69ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 88.8MB in the beginning and 122.5MB in the end (delta: -33.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-10 09:01:50,656 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 188.7MB. Free memory is still 122.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 09:01:50,658 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.11ms. Allocated memory is still 142.6MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.34ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 111.2MB in the end (delta: -39.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.17ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 108.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.60ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 106.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 346.96ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 89.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 914.69ms. Allocated memory was 142.6MB in the beginning and 188.7MB in the end (delta: 46.1MB). Free memory was 88.8MB in the beginning and 122.5MB in the end (delta: -33.7MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 188.7MB. Free memory is still 122.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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 46, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 4.6; [L30] unsigned long int var_1_9 = 256; [L31] unsigned char var_1_10 = 0; [L32] unsigned long int var_1_11 = 3724367395; [L33] unsigned long int var_1_12 = 25; [L34] unsigned long int var_1_13 = 1; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 100; VAL [isInitial=0, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L68] var_1_2 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L70] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L71] var_1_3 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L72] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L73] var_1_4 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L74] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L75] var_1_5 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L76] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L77] var_1_6 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L78] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_8=23/5, var_1_9=256] [L79] var_1_8 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L80] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L82] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=3724367395, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L84] var_1_11 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_11 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L85] RET assume_abort_if_not(var_1_11 >= 3221225470) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L86] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=25, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L87] var_1_12 = __VERIFIER_nondet_ulong() [L88] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L88] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] CALL assume_abort_if_not(var_1_12 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L89] RET assume_abort_if_not(var_1_12 <= 1073741823) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=1, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L90] var_1_13 = __VERIFIER_nondet_ulong() [L91] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L91] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L92] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=128, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L93] var_1_15 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L94] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L95] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=100, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L96] var_1_16 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L97] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L98] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_1=3/5, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L111] RET updateVariables() [L112] CALL step() [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_7=51/5, var_1_9=256] [L46] var_1_7 = ((15.5 + var_1_4) - (var_1_3 - var_1_8)) [L47] unsigned long int stepLocal_2 = var_1_13; [L48] signed long int stepLocal_1 = 5; VAL [isInitial=1, stepLocal_1=5, stepLocal_2=-3221225474, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L49] COND FALSE !(stepLocal_1 >= var_1_11) VAL [isInitial=1, stepLocal_2=-3221225474, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L60] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=-255, stepLocal_2=-3221225474, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=256] [L61] COND TRUE var_1_10 || stepLocal_0 [L62] var_1_9 = ((var_1_11 - var_1_14) - var_1_14) VAL [isInitial=1, stepLocal_2=-3221225474, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L112] RET step() [L113] CALL, EXPR property() [L103-L104] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_7 == ((double) ((15.5 + var_1_4) - (var_1_3 - var_1_8))))) && ((var_1_10 || var_1_2) ? (var_1_9 == ((unsigned long int) ((var_1_11 - var_1_14) - var_1_14))) : (var_1_9 == ((unsigned long int) (var_1_14 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))))) && ((5 >= var_1_11) ? ((var_1_1 >= var_1_8) ? (var_1_14 == ((unsigned char) (128 - 16))) : ((var_1_13 >= ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_14 == ((unsigned char) (var_1_15 - var_1_16))) : (var_1_14 == ((unsigned char) var_1_16)))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=4294967294, var_1_12=1073741823, var_1_13=-3221225474, var_1_14=1, var_1_15=32895, var_1_16=-129, var_1_2=-255, var_1_9=4294967292] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 19, 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, 78 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, 78 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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.2s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 122 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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-10 09:01:50,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.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 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 09:01:52,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 09:01:52,735 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 09:01:52,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 09:01:52,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 09:01:52,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 09:01:52,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 09:01:52,776 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 09:01:52,776 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 09:01:52,777 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 09:01:52,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 09:01:52,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 09:01:52,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 09:01:52,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 09:01:52,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 09:01:52,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 09:01:52,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 09:01:52,778 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 09:01:52,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 09:01:52,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 09:01:52,779 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 09:01:52,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 09:01:52,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 09:01:52,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 09:01:52,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 09:01:52,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 09:01:52,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 09:01:52,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 09:01:52,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 09:01:52,781 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 09:01:52,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 09:01:52,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 09:01:52,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 09:01:52,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 09:01:52,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:52,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 09:01:52,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 09:01:52,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 09:01:52,783 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 09:01:52,784 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 09:01:52,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 09:01:52,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 09:01:52,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 09:01:52,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 09:01:52,787 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 -> 7450394d9b42bbab28f41eb9cd320d1bfd5e5369ed04b7325d413479a72d2da0 [2024-11-10 09:01:53,047 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 09:01:53,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 09:01:53,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 09:01:53,071 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 09:01:53,071 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 09:01:53,073 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-20.i [2024-11-10 09:01:54,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 09:01:54,656 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 09:01:54,657 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-20.i [2024-11-10 09:01:54,663 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111e070c4/e1e3eb95e47e420ea5d2fda19647bf1e/FLAG792cf5d43 [2024-11-10 09:01:54,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/111e070c4/e1e3eb95e47e420ea5d2fda19647bf1e [2024-11-10 09:01:54,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 09:01:54,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 09:01:54,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:54,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 09:01:54,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 09:01:54,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:54,697 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95794a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54, skipping insertion in model container [2024-11-10 09:01:54,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:54,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 09:01:54,871 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-20.i[913,926] [2024-11-10 09:01:54,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:54,939 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 09:01:54,954 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-20.i[913,926] [2024-11-10 09:01:54,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 09:01:54,999 INFO L204 MainTranslator]: Completed translation [2024-11-10 09:01:55,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54 WrapperNode [2024-11-10 09:01:55,000 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 09:01:55,001 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:55,001 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 09:01:55,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 09:01:55,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,022 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,050 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-10 09:01:55,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 09:01:55,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 09:01:55,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 09:01:55,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 09:01:55,060 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,067 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,084 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-10 09:01:55,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 09:01:55,108 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 09:01:55,111 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 09:01:55,111 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 09:01:55,112 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (1/1) ... [2024-11-10 09:01:55,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 09:01:55,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 09:01:55,151 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-10 09:01:55,154 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-10 09:01:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 09:01:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 09:01:55,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 09:01:55,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 09:01:55,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 09:01:55,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 09:01:55,271 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 09:01:55,274 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 09:02:03,917 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 09:02:03,918 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 09:02:03,928 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 09:02:03,928 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 09:02:03,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:02:03 BoogieIcfgContainer [2024-11-10 09:02:03,929 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 09:02:03,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 09:02:03,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 09:02:03,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 09:02:03,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:01:54" (1/3) ... [2024-11-10 09:02:03,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5168b18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:02:03, skipping insertion in model container [2024-11-10 09:02:03,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:01:54" (2/3) ... [2024-11-10 09:02:03,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5168b18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:02:03, skipping insertion in model container [2024-11-10 09:02:03,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 09:02:03" (3/3) ... [2024-11-10 09:02:03,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-20.i [2024-11-10 09:02:03,949 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 09:02:03,950 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 09:02:03,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 09:02:04,004 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;@3d554d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 09:02:04,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 09:02:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:02:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 09:02:04,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:02:04,018 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:04,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:02:04,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:02:04,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1815957852, now seen corresponding path program 1 times [2024-11-10 09:02:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:02:04,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617977238] [2024-11-10 09:02:04,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:02:04,036 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-10 09:02:04,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:02:04,039 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-10 09:02:04,040 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-10 09:02:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:02:04,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 09:02:04,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:02:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2024-11-10 09:02:04,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 09:02:04,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 09:02:04,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617977238] [2024-11-10 09:02:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617977238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 09:02:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 09:02:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 09:02:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46266709] [2024-11-10 09:02:04,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 09:02:04,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 09:02:04,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 09:02:04,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 09:02:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 09:02:04,577 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.263157894736842) internal successors, (48), 39 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:02:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 09:02:04,607 INFO L93 Difference]: Finished difference Result 112 states and 184 transitions. [2024-11-10 09:02:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 09:02:04,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2024-11-10 09:02:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 09:02:04,616 INFO L225 Difference]: With dead ends: 112 [2024-11-10 09:02:04,617 INFO L226 Difference]: Without dead ends: 55 [2024-11-10 09:02:04,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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-10 09:02:04,625 INFO L432 NwaCegarLoop]: 78 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, 78 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-10 09:02:04,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 09:02:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-10 09:02:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-10 09:02:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-10 09:02:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 78 transitions. [2024-11-10 09:02:04,658 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 78 transitions. Word has length 123 [2024-11-10 09:02:04,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 09:02:04,659 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 78 transitions. [2024-11-10 09:02:04,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-10 09:02:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 78 transitions. [2024-11-10 09:02:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-10 09:02:04,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 09:02:04,661 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 09:02:04,687 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-10 09:02:04,862 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-10 09:02:04,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 09:02:04,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 09:02:04,863 INFO L85 PathProgramCache]: Analyzing trace with hash -564304489, now seen corresponding path program 1 times [2024-11-10 09:02:04,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 09:02:04,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115078523] [2024-11-10 09:02:04,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 09:02:04,864 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-10 09:02:04,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 09:02:04,866 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-10 09:02:04,868 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-10 09:02:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 09:02:05,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 09:02:05,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 09:02:40,820 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:02:48,966 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:02:57,109 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:03:05,264 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:03:13,418 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:03:21,276 WARN L286 SmtUtils]: Spent 7.86s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-10 09:03:29,368 WARN L286 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)