./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 84e633614e7482dba224b999e9bb081b04011a937c6424777dcebad70121d48c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:54:35,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:54:35,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:54:35,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:54:35,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:54:35,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:54:35,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:54:35,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:54:35,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:54:35,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:54:35,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:54:35,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:54:35,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:54:35,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:54:35,912 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:54:35,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:54:35,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:54:35,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:54:35,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:54:35,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:54:35,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:54:35,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:54:35,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:54:35,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:54:35,919 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:54:35,920 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:54:35,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:54:35,920 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:54:35,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:54:35,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:54:35,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:54:35,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:54:35,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:35,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:54:35,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:54:35,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:54:35,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:54:35,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:54:35,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:54:35,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:54:35,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:54:35,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:54:35,925 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-clean/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-clean/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 -> 84e633614e7482dba224b999e9bb081b04011a937c6424777dcebad70121d48c [2024-10-11 12:54:36,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:54:36,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:54:36,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:54:36,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:54:36,207 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:54:36,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:37,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:54:37,924 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:54:37,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:37,937 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7902143d7/d62e632cf83b409b9d168715d8f96157/FLAG9179b9a82 [2024-10-11 12:54:37,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7902143d7/d62e632cf83b409b9d168715d8f96157 [2024-10-11 12:54:37,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:54:37,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:54:37,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:37,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:54:37,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:54:37,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:37" (1/1) ... [2024-10-11 12:54:37,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a25f4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:37, skipping insertion in model container [2024-10-11 12:54:37,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:37" (1/1) ... [2024-10-11 12:54:37,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:54:38,170 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i[915,928] [2024-10-11 12:54:38,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:38,274 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:54:38,314 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i[915,928] [2024-10-11 12:54:38,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:38,415 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:54:38,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38 WrapperNode [2024-10-11 12:54:38,416 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:38,417 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:38,417 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:54:38,417 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:54:38,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,481 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-11 12:54:38,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:38,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:54:38,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:54:38,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:54:38,502 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,530 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:54:38,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,537 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,546 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,550 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,554 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:54:38,559 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:54:38,559 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:54:38,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:54:38,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (1/1) ... [2024-10-11 12:54:38,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:38,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:54:38,602 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:54:38,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:54:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:54:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:54:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:54:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:54:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:54:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:54:38,751 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:54:38,753 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:54:39,117 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 12:54:39,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:54:39,175 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:54:39,175 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:54:39,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:39 BoogieIcfgContainer [2024-10-11 12:54:39,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:54:39,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:54:39,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:54:39,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:54:39,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:54:37" (1/3) ... [2024-10-11 12:54:39,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d348a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:39, skipping insertion in model container [2024-10-11 12:54:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:38" (2/3) ... [2024-10-11 12:54:39,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d348a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:39, skipping insertion in model container [2024-10-11 12:54:39,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:39" (3/3) ... [2024-10-11 12:54:39,187 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:39,201 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:54:39,201 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:54:39,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:54:39,265 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;@7b42a754, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:54:39,266 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:54:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:54:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:54:39,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:39,286 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:39,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash -564198568, now seen corresponding path program 1 times [2024-10-11 12:54:39,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:54:39,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68944589] [2024-10-11 12:54:39,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:39,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:54:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:54:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:54:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:54:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:54:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:54:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:54:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:54:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:54:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:54:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:54:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:54:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:54:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:54:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:54:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:54:39,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:54:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:54:39,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:54:39,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68944589] [2024-10-11 12:54:39,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68944589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:54:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:54:39,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:54:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603273928] [2024-10-11 12:54:39,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:54:39,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:54:39,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:54:39,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:54:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:39,757 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:54:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:54:39,795 INFO L93 Difference]: Finished difference Result 121 states and 204 transitions. [2024-10-11 12:54:39,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:54:39,801 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 108 [2024-10-11 12:54:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:54:39,810 INFO L225 Difference]: With dead ends: 121 [2024-10-11 12:54:39,810 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 12:54:39,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:39,820 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:54:39,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:54:39,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 12:54:39,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-11 12:54:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.380952380952381) internal successors, (58), 42 states have internal predecessors, (58), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:54:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2024-10-11 12:54:39,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 108 [2024-10-11 12:54:39,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:54:39,884 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2024-10-11 12:54:39,884 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:54:39,885 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2024-10-11 12:54:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:54:39,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:39,889 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:39,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:54:39,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:39,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1232168032, now seen corresponding path program 1 times [2024-10-11 12:54:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:54:39,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779507675] [2024-10-11 12:54:39,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:39,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:54:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:54:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 12:54:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:54:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 12:54:40,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:54:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 12:54:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:54:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 12:54:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:54:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 12:54:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 12:54:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 12:54:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:54:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 12:54:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 12:54:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 12:54:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 12:54:40,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:54:40,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779507675] [2024-10-11 12:54:40,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779507675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:54:40,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:54:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:54:40,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162086072] [2024-10-11 12:54:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:54:40,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:54:40,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:54:40,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:54:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:54:40,623 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:54:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:54:40,970 INFO L93 Difference]: Finished difference Result 181 states and 272 transitions. [2024-10-11 12:54:40,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 12:54:40,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-10-11 12:54:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:54:40,974 INFO L225 Difference]: With dead ends: 181 [2024-10-11 12:54:40,976 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 12:54:40,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:54:40,979 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:54:40,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 362 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:54:40,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 12:54:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-10-11 12:54:41,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.3544303797468353) internal successors, (107), 79 states have internal predecessors, (107), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 12:54:41,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2024-10-11 12:54:41,018 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 108 [2024-10-11 12:54:41,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:54:41,019 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2024-10-11 12:54:41,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 12:54:41,019 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2024-10-11 12:54:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 12:54:41,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:41,024 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:41,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:54:41,024 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:41,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:41,025 INFO L85 PathProgramCache]: Analyzing trace with hash -2051682014, now seen corresponding path program 1 times [2024-10-11 12:54:41,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:54:41,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980215340] [2024-10-11 12:54:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:54:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:54:41,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:54:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:54:41,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:54:41,576 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:54:41,577 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:54:41,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:54:41,585 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:54:41,689 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:54:41,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:54:41 BoogieIcfgContainer [2024-10-11 12:54:41,693 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:54:41,694 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:54:41,694 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:54:41,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:54:41,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:39" (3/4) ... [2024-10-11 12:54:41,697 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:54:41,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:54:41,699 INFO L158 Benchmark]: Toolchain (without parser) took 3742.89ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 102.8MB in the beginning and 123.8MB in the end (delta: -21.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,702 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:54:41,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.06ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 129.0MB in the end (delta: -26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.06ms. Allocated memory is still 157.3MB. Free memory was 129.0MB in the beginning and 125.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,703 INFO L158 Benchmark]: Boogie Preprocessor took 72.07ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 122.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,703 INFO L158 Benchmark]: RCFGBuilder took 616.49ms. Allocated memory is still 157.3MB. Free memory was 122.7MB in the beginning and 97.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,704 INFO L158 Benchmark]: TraceAbstraction took 2513.59ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 97.1MB in the beginning and 124.9MB in the end (delta: -27.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2024-10-11 12:54:41,704 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 199.2MB. Free memory was 124.9MB in the beginning and 123.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:54:41,709 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.65ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 458.06ms. Allocated memory is still 157.3MB. Free memory was 102.4MB in the beginning and 129.0MB in the end (delta: -26.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.06ms. Allocated memory is still 157.3MB. Free memory was 129.0MB in the beginning and 125.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.07ms. Allocated memory is still 157.3MB. Free memory was 125.6MB in the beginning and 122.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 616.49ms. Allocated memory is still 157.3MB. Free memory was 122.7MB in the beginning and 97.5MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2513.59ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 97.1MB in the beginning and 124.9MB in the end (delta: -27.8MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 199.2MB. Free memory was 124.9MB in the beginning and 123.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of bitwiseOr at line 126, overapproximation of someBinaryArithmeticFLOAToperation at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -1; [L23] unsigned char var_1_6 = 0; [L24] signed short int var_1_7 = 8; [L25] signed short int var_1_8 = 4; [L26] unsigned long int var_1_9 = 256; [L27] unsigned long int var_1_10 = 10; [L28] unsigned long int var_1_11 = 3084274888; [L29] unsigned long int var_1_13 = 50; [L30] signed long int var_1_14 = -10; [L31] unsigned char var_1_16 = 0; [L32] float var_1_19 = 4.5; [L33] float var_1_20 = 15.375; [L34] float var_1_21 = 32.725; [L35] float var_1_22 = 63.5; [L36] float var_1_23 = 16.375; [L37] signed char var_1_24 = -32; [L38] signed char var_1_25 = 0; [L39] unsigned short int var_1_26 = 64; [L40] unsigned long int last_1_var_1_9 = 256; [L41] unsigned long int last_1_var_1_10 = 10; [L42] signed long int last_1_var_1_14 = -10; [L43] signed char last_1_var_1_24 = -32; [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L120] last_1_var_1_9 = var_1_9 [L121] last_1_var_1_10 = var_1_10 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_24 = var_1_24 [L133] RET updateLastVariables() [L134] CALL updateVariables() [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_7=8, var_1_8=4, var_1_9=256] [L94] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L94] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=8, var_1_8=4, var_1_9=256] [L95] var_1_7 = __VERIFIER_nondet_short() [L96] CALL assume_abort_if_not(var_1_7 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L96] RET assume_abort_if_not(var_1_7 >= -1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L97] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L97] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=4, var_1_9=256] [L98] var_1_8 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L100] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L100] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=3084274888, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L102] RET assume_abort_if_not(var_1_11 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L103] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L103] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=0, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L104] var_1_16 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L105] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L106] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L106] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_20=123/8, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L107] var_1_20 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L108] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_21=1309/40, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L109] var_1_21 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L110] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_22=127/2, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L111] var_1_22 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L112] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_23=131/8, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L113] var_1_23 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L114] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=0, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L115] var_1_25 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_25 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L116] RET assume_abort_if_not(var_1_25 >= -127) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L117] CALL assume_abort_if_not(var_1_25 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L117] RET assume_abort_if_not(var_1_25 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L134] RET updateVariables() [L135] CALL step() [L47] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=-1, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L47] unsigned long int stepLocal_0 = (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10; [L48] COND TRUE stepLocal_0 < (last_1_var_1_24 | -4) [L49] var_1_1 = (var_1_7 - var_1_8) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-32, var_1_25=-127, var_1_26=64, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L53] var_1_24 = var_1_25 [L54] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-10, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L55] COND FALSE !(var_1_26 >= var_1_7) [L64] var_1_14 = var_1_24 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=10, var_1_11=-2, var_1_13=50, var_1_14=-127, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L66] var_1_10 = ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26)))))) [L67] unsigned long int stepLocal_3 = var_1_8 / (1u + 16u); [L68] unsigned long int stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=-2, stepLocal_3=4, var_1_10=68, var_1_11=-2, var_1_13=50, var_1_14=-127, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L69] COND FALSE !(var_1_26 < stepLocal_3) [L76] var_1_13 = var_1_8 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=-2, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L78] signed short int stepLocal_4 = var_1_8; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=-2, stepLocal_4=68, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=9/2, var_1_1=256, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L79] COND TRUE stepLocal_4 <= var_1_13 [L80] var_1_19 = (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=-2, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L84] unsigned long int stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_1=68, stepLocal_2=-2, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L85] COND FALSE !(stepLocal_1 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, stepLocal_2=-2, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR (last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L126-L127] return ((((((((((last_1_var_1_10 + last_1_var_1_14) ^ last_1_var_1_10) < (last_1_var_1_24 | -4)) ? (var_1_1 == ((signed short int) (var_1_7 - var_1_8))) : (var_1_1 == ((signed short int) (last_1_var_1_10 + -16)))) && ((var_1_10 >= ((((var_1_1) < (last_1_var_1_9)) ? (var_1_1) : (last_1_var_1_9)))) ? (var_1_6 ? (var_1_9 == ((unsigned long int) var_1_8)) : 1) : 1)) && (var_1_10 == ((unsigned long int) ((((((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) < (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))) ? (((((var_1_11 - var_1_8) < 0 ) ? -(var_1_11 - var_1_8) : (var_1_11 - var_1_8)))) : (((((0u) > (var_1_26)) ? (0u) : (var_1_26))))))))) && ((var_1_26 < (var_1_8 / (1u + 16u))) ? ((var_1_11 > (var_1_26 + 5u)) ? (var_1_13 == ((unsigned long int) ((((var_1_26) > (var_1_11)) ? (var_1_26) : (var_1_11))))) : (var_1_13 == ((unsigned long int) 5u))) : (var_1_13 == ((unsigned long int) var_1_8)))) && ((var_1_26 >= var_1_7) ? ((var_1_1 > var_1_11) ? ((var_1_6 && var_1_16) ? (var_1_14 == ((signed long int) (var_1_7 - (var_1_26 + var_1_8)))) : (var_1_14 == ((signed long int) var_1_26))) : 1) : (var_1_14 == ((signed long int) var_1_24)))) && ((var_1_8 <= var_1_13) ? (var_1_19 == ((float) (((((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) > (var_1_23)) ? ((((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21))) + var_1_22)) : (var_1_23))))) : (var_1_19 == ((float) var_1_22)))) && (var_1_24 == ((signed char) var_1_25))) && (var_1_26 == ((unsigned short int) var_1_8)) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_14=-10, last_1_var_1_24=-32, last_1_var_1_9=256, var_1_10=68, var_1_11=-2, var_1_13=68, var_1_14=-127, var_1_16=1, var_1_19=3084274893, var_1_1=256, var_1_23=3084274893, var_1_24=-127, var_1_25=-127, var_1_26=68, var_1_6=1, var_1_7=324, var_1_8=68, var_1_9=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 3, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 78 mSDsluCounter, 449 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 159 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=114occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 960/960 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:54:41,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 84e633614e7482dba224b999e9bb081b04011a937c6424777dcebad70121d48c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:54:44,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:54:44,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:54:44,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:54:44,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:54:44,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:54:44,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:54:44,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:54:44,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:54:44,165 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:54:44,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:54:44,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:54:44,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:54:44,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:54:44,168 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:54:44,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:54:44,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:54:44,169 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:54:44,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:54:44,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:54:44,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:54:44,174 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:54:44,174 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:54:44,175 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:54:44,175 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:54:44,175 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:54:44,175 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:54:44,175 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:54:44,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:54:44,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:54:44,176 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:54:44,176 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:54:44,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:54:44,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:54:44,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:44,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:54:44,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:54:44,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:54:44,181 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:54:44,181 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:54:44,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:54:44,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:54:44,182 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:54:44,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:54:44,183 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:54:44,183 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-clean/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-clean/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 -> 84e633614e7482dba224b999e9bb081b04011a937c6424777dcebad70121d48c [2024-10-11 12:54:44,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:54:44,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:54:44,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:54:44,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:54:44,561 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:54:44,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:46,145 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:54:46,383 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:54:46,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:46,402 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9dd3f1c67/ccc4bf03136a48748770618a9ea993f3/FLAGad4706f2c [2024-10-11 12:54:46,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9dd3f1c67/ccc4bf03136a48748770618a9ea993f3 [2024-10-11 12:54:46,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:54:46,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:54:46,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:46,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:54:46,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:54:46,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a327558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46, skipping insertion in model container [2024-10-11 12:54:46,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:54:46,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i[915,928] [2024-10-11 12:54:46,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:46,768 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:54:46,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-39.i[915,928] [2024-10-11 12:54:46,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:54:46,863 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:54:46,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46 WrapperNode [2024-10-11 12:54:46,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:54:46,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:46,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:54:46,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:54:46,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,937 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 134 [2024-10-11 12:54:46,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:54:46,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:54:46,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:54:46,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:54:46,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,950 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,977 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:54:46,977 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,977 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,990 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:46,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:47,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:47,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:47,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:54:47,014 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:54:47,014 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:54:47,014 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:54:47,015 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (1/1) ... [2024-10-11 12:54:47,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:54:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:54:47,053 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:54:47,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:54:47,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:54:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:54:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:54:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:54:47,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:54:47,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:54:47,195 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:54:47,201 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:54:47,724 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 12:54:47,724 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:54:47,805 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:54:47,805 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:54:47,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:47 BoogieIcfgContainer [2024-10-11 12:54:47,806 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:54:47,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:54:47,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:54:47,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:54:47,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:54:46" (1/3) ... [2024-10-11 12:54:47,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dd698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:47, skipping insertion in model container [2024-10-11 12:54:47,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:54:46" (2/3) ... [2024-10-11 12:54:47,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35dd698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:54:47, skipping insertion in model container [2024-10-11 12:54:47,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:54:47" (3/3) ... [2024-10-11 12:54:47,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-39.i [2024-10-11 12:54:47,834 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:54:47,835 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:54:47,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:54:47,913 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;@26abf1a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:54:47,913 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:54:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:54:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 12:54:47,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:47,934 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:47,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash -198763828, now seen corresponding path program 1 times [2024-10-11 12:54:47,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:54:47,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910621851] [2024-10-11 12:54:47,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:47,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:54:47,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:54:47,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:54:47,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:54:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:48,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:54:48,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:54:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-10-11 12:54:48,276 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:54:48,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:54:48,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910621851] [2024-10-11 12:54:48,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910621851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:54:48,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:54:48,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:54:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384984392] [2024-10-11 12:54:48,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:54:48,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:54:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:54:48,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:54:48,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:48,315 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 34 states have internal predecessors, (47), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:54:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:54:48,449 INFO L93 Difference]: Finished difference Result 101 states and 172 transitions. [2024-10-11 12:54:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:54:48,458 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2024-10-11 12:54:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:54:48,466 INFO L225 Difference]: With dead ends: 101 [2024-10-11 12:54:48,466 INFO L226 Difference]: Without dead ends: 50 [2024-10-11 12:54:48,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:54:48,474 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:54:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:54:48,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-11 12:54:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-11 12:54:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:54:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2024-10-11 12:54:48,523 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 104 [2024-10-11 12:54:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:54:48,525 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2024-10-11 12:54:48,526 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 12:54:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2024-10-11 12:54:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 12:54:48,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:54:48,530 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:54:48,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 12:54:48,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:54:48,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:54:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:54:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1399013332, now seen corresponding path program 1 times [2024-10-11 12:54:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:54:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904612575] [2024-10-11 12:54:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:54:48,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:54:48,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:54:48,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:54:48,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:54:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:54:48,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 12:54:48,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:55:17,536 WARN L286 SmtUtils]: Spent 8.03s 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-10-11 12:55:41,151 WARN L286 SmtUtils]: Spent 20.67s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 12:56:01,458 WARN L286 SmtUtils]: Spent 8.03s 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)