./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_fillercode_fillercodesize_ps-cn-25_file-25.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_fillercode_fillercodesize_ps-cn-25_file-25.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 a0009a7cc532886ea56e5f181eee8768048a166795586f8a0c5ab4cb16269407 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:23:42,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:23:42,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:23:42,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:23:42,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:23:42,825 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:23:42,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:23:42,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:23:42,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:23:42,827 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:23:42,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:23:42,828 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:23:42,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:23:42,829 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:23:42,829 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:23:42,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:23:42,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:23:42,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:23:42,831 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:23:42,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:23:42,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:23:42,835 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:23:42,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:23:42,836 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:23:42,836 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:23:42,836 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:23:42,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:23:42,837 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:23:42,837 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:23:42,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:23:42,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:23:42,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:23:42,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:23:42,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:23:42,839 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:23:42,839 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:23:42,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:23:42,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:23:42,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:23:42,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:23:42,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:23:42,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:23:42,845 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 -> a0009a7cc532886ea56e5f181eee8768048a166795586f8a0c5ab4cb16269407 [2024-10-11 08:23:43,098 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:23:43,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:23:43,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:23:43,131 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:23:43,132 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:23:43,133 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:44,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:23:44,861 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:23:44,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:44,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a0e63725/5a070a701103414ab7617a63f6708888/FLAG06a589580 [2024-10-11 08:23:44,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a0e63725/5a070a701103414ab7617a63f6708888 [2024-10-11 08:23:44,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:23:44,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:23:44,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:23:44,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:23:44,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:23:44,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:44" (1/1) ... [2024-10-11 08:23:44,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45121737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:44, skipping insertion in model container [2024-10-11 08:23:44,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:44" (1/1) ... [2024-10-11 08:23:44,952 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:23:45,139 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_fillercode_fillercodesize_ps-cn-25_file-25.i[915,928] [2024-10-11 08:23:45,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:23:45,218 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:23:45,228 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_fillercode_fillercodesize_ps-cn-25_file-25.i[915,928] [2024-10-11 08:23:45,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:23:45,288 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:23:45,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45 WrapperNode [2024-10-11 08:23:45,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:23:45,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:23:45,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:23:45,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:23:45,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,363 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-11 08:23:45,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:23:45,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:23:45,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:23:45,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:23:45,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,405 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 08:23:45,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,426 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:23:45,442 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:23:45,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:23:45,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:23:45,444 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (1/1) ... [2024-10-11 08:23:45,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:23:45,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:23:45,529 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 08:23:45,541 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 08:23:45,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:23:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:23:45,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:23:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:23:45,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:23:45,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:23:45,714 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:23:45,716 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:23:46,168 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 08:23:46,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:23:46,229 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:23:46,229 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:23:46,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:46 BoogieIcfgContainer [2024-10-11 08:23:46,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:23:46,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:23:46,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:23:46,236 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:23:46,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:23:44" (1/3) ... [2024-10-11 08:23:46,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f413682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:46, skipping insertion in model container [2024-10-11 08:23:46,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:45" (2/3) ... [2024-10-11 08:23:46,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f413682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:46, skipping insertion in model container [2024-10-11 08:23:46,239 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:46" (3/3) ... [2024-10-11 08:23:46,241 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:46,260 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:23:46,260 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:23:46,330 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:23:46,336 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;@4e8f9eae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:23:46,337 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:23:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:23:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 08:23:46,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:46,357 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:46,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 862438441, now seen corresponding path program 1 times [2024-10-11 08:23:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:23:46,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269285332] [2024-10-11 08:23:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:23:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:23:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:23:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:23:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:23:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:23:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:23:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 08:23:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:23:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:23:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:23:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:23:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:23:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:23:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:23:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:23:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:23:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:23:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:23:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:23:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:23:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:23:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:23:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:23:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:23:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:23:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 08:23:46,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:23:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269285332] [2024-10-11 08:23:46,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269285332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:23:46,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:23:46,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:23:46,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106044001] [2024-10-11 08:23:46,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:23:46,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:23:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:23:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:23:46,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:23:46,974 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.4375) internal successors, (69), 49 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 08:23:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:23:47,025 INFO L93 Difference]: Finished difference Result 149 states and 261 transitions. [2024-10-11 08:23:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:23:47,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 161 [2024-10-11 08:23:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:23:47,038 INFO L225 Difference]: With dead ends: 149 [2024-10-11 08:23:47,038 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 08:23:47,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 08:23:47,049 INFO L432 NwaCegarLoop]: 111 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, 111 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 08:23:47,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:23:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 08:23:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-10-11 08:23:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:23:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2024-10-11 08:23:47,118 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 161 [2024-10-11 08:23:47,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:23:47,118 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2024-10-11 08:23:47,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 08:23:47,119 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2024-10-11 08:23:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 08:23:47,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:47,123 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:47,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:23:47,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:47,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:47,128 INFO L85 PathProgramCache]: Analyzing trace with hash 463768995, now seen corresponding path program 1 times [2024-10-11 08:23:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:23:47,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443488000] [2024-10-11 08:23:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:23:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:23:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:23:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:23:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:23:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:23:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:23:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 08:23:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:23:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:23:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:23:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:23:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:23:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:23:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:23:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:23:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:23:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:23:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:23:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:23:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:23:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:23:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:23:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:23:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:23:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:23:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 08:23:47,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:23:47,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443488000] [2024-10-11 08:23:47,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443488000] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:23:47,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:23:47,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:23:47,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714938033] [2024-10-11 08:23:47,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:23:47,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:23:47,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:23:47,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:23:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:23:47,515 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:47,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:23:47,575 INFO L93 Difference]: Finished difference Result 198 states and 303 transitions. [2024-10-11 08:23:47,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:23:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-11 08:23:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:23:47,579 INFO L225 Difference]: With dead ends: 198 [2024-10-11 08:23:47,580 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 08:23:47,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:23:47,584 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 73 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:23:47,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 244 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:23:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 08:23:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-10-11 08:23:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 83 states have internal predecessors, (113), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:23:47,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 187 transitions. [2024-10-11 08:23:47,621 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 187 transitions. Word has length 161 [2024-10-11 08:23:47,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:23:47,622 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 187 transitions. [2024-10-11 08:23:47,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:47,623 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 187 transitions. [2024-10-11 08:23:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 08:23:47,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:47,625 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:47,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:23:47,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:47,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1225174747, now seen corresponding path program 1 times [2024-10-11 08:23:47,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:23:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87254126] [2024-10-11 08:23:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:47,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:23:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:23:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 08:23:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 08:23:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 08:23:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 08:23:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 08:23:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 08:23:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 08:23:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 08:23:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 08:23:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 08:23:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:23:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:23:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:23:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 08:23:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:23:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 08:23:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:23:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 08:23:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:23:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 08:23:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 08:23:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 08:23:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 08:23:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 08:23:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:48,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 08:23:48,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:23:48,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87254126] [2024-10-11 08:23:48,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87254126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:23:48,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:23:48,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 08:23:48,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737871866] [2024-10-11 08:23:48,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:23:48,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:23:48,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:23:48,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:23:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:23:48,466 INFO L87 Difference]: Start difference. First operand 122 states and 187 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:48,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:23:48,720 INFO L93 Difference]: Finished difference Result 243 states and 373 transitions. [2024-10-11 08:23:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:23:48,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 161 [2024-10-11 08:23:48,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:23:48,727 INFO L225 Difference]: With dead ends: 243 [2024-10-11 08:23:48,729 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 08:23:48,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:23:48,733 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 189 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:23:48,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 151 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:23:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 08:23:48,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 08:23:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 82 states have (on average 1.329268292682927) internal successors, (109), 83 states have internal predecessors, (109), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:23:48,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 183 transitions. [2024-10-11 08:23:48,772 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 183 transitions. Word has length 161 [2024-10-11 08:23:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:23:48,775 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 183 transitions. [2024-10-11 08:23:48,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:48,776 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 183 transitions. [2024-10-11 08:23:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-11 08:23:48,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:48,781 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:48,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:23:48,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:48,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:48,782 INFO L85 PathProgramCache]: Analyzing trace with hash 673647621, now seen corresponding path program 1 times [2024-10-11 08:23:48,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:23:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782035125] [2024-10-11 08:23:48,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:48,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:23:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:23:48,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083277966] [2024-10-11 08:23:48,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:23:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:23:48,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:23:48,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:23:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:23:49,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:23:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:23:49,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:23:49,326 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:23:49,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:23:49,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:23:49,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:23:49,534 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 08:23:49,680 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:23:49,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:23:49 BoogieIcfgContainer [2024-10-11 08:23:49,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:23:49,684 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:23:49,684 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:23:49,684 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:23:49,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:46" (3/4) ... [2024-10-11 08:23:49,688 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:23:49,689 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:23:49,692 INFO L158 Benchmark]: Toolchain (without parser) took 4786.03ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 95.4MB in the beginning and 79.2MB in the end (delta: 16.2MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,692 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:23:49,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.04ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 79.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,693 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.64ms. Allocated memory is still 165.7MB. Free memory was 79.0MB in the beginning and 75.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,693 INFO L158 Benchmark]: Boogie Preprocessor took 77.57ms. Allocated memory is still 165.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,694 INFO L158 Benchmark]: RCFGBuilder took 787.11ms. Allocated memory is still 165.7MB. Free memory was 70.8MB in the beginning and 108.1MB in the end (delta: -37.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,694 INFO L158 Benchmark]: TraceAbstraction took 3451.51ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 107.6MB in the beginning and 80.2MB in the end (delta: 27.4MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,694 INFO L158 Benchmark]: Witness Printer took 5.29ms. Allocated memory is still 220.2MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:23:49,696 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.04ms. Allocated memory is still 165.7MB. Free memory was 95.4MB in the beginning and 79.0MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.64ms. Allocated memory is still 165.7MB. Free memory was 79.0MB in the beginning and 75.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.57ms. Allocated memory is still 165.7MB. Free memory was 75.5MB in the beginning and 70.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 787.11ms. Allocated memory is still 165.7MB. Free memory was 70.8MB in the beginning and 108.1MB in the end (delta: -37.3MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3451.51ms. Allocated memory was 165.7MB in the beginning and 220.2MB in the end (delta: 54.5MB). Free memory was 107.6MB in the beginning and 80.2MB in the end (delta: 27.4MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 5.29ms. Allocated memory is still 220.2MB. Free memory was 80.2MB in the beginning and 79.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -256; [L23] signed short int var_1_5 = -256; [L24] double var_1_7 = 256.25; [L25] double var_1_8 = 127.8; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] float var_1_12 = 999.75; [L29] float var_1_13 = 64.5; [L30] float var_1_14 = 127.25; [L31] signed char var_1_15 = -32; [L32] float var_1_16 = 32.7; [L33] unsigned char var_1_17 = 16; [L34] unsigned char var_1_18 = 32; [L35] unsigned short int var_1_19 = 5; [L36] signed long int var_1_21 = 100; [L37] signed short int var_1_22 = 50; [L38] double var_1_23 = 1000000.75; [L39] unsigned long int var_1_24 = 16; [L40] unsigned char var_1_25 = 1; [L41] unsigned long int var_1_26 = 64; [L42] unsigned long int var_1_27 = 4; [L43] double var_1_28 = 15.5; [L44] double var_1_29 = 1.575; [L45] signed long int var_1_30 = 10; [L46] unsigned char var_1_31 = 1; [L47] signed long int var_1_32 = 8; [L48] unsigned char var_1_33 = 1; [L49] unsigned char var_1_34 = 0; [L50] unsigned char var_1_35 = 0; [L51] unsigned long int var_1_36 = 1; [L52] double var_1_37 = 1.2; [L53] signed long int last_1_var_1_1 = -256; [L54] signed short int last_1_var_1_5 = -256; [L55] unsigned char last_1_var_1_10 = 0; [L56] unsigned short int last_1_var_1_19 = 5; [L57] signed short int last_1_var_1_22 = 50; [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L175] last_1_var_1_1 = var_1_1 [L176] last_1_var_1_5 = var_1_5 [L177] last_1_var_1_10 = var_1_10 [L178] last_1_var_1_19 = var_1_19 [L179] last_1_var_1_22 = var_1_22 [L189] RET updateLastVariables() [L190] CALL updateVariables() [L133] var_1_7 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256, var_1_8=639/5] [L134] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256, var_1_8=639/5] [L135] var_1_8 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L136] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_13=129/2, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L140] var_1_13 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L141] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=509/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L142] var_1_14 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L143] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=-32, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L144] var_1_15 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_15 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L145] RET assume_abort_if_not(var_1_15 >= -128) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L146] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L146] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L147] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L147] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_16=327/10, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L148] var_1_16 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L149] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=32, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L150] var_1_18 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L151] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L152] CALL assume_abort_if_not(var_1_18 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L152] RET assume_abort_if_not(var_1_18 <= 254) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=1, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L153] var_1_25 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L154] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L155] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L155] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=64, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L156] var_1_26 = __VERIFIER_nondet_ulong() [L157] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L157] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L158] CALL assume_abort_if_not(var_1_26 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L158] RET assume_abort_if_not(var_1_26 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=4, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L159] var_1_27 = __VERIFIER_nondet_ulong() [L160] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L160] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L161] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L161] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_29=63/40, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L162] var_1_29 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L163] RET assume_abort_if_not((var_1_29 >= -922337.2036854765600e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L164] var_1_31 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L165] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L166] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L166] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=8, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L167] var_1_32 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L168] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L169] CALL assume_abort_if_not(var_1_32 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L169] RET assume_abort_if_not(var_1_32 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L170] var_1_34 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L171] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L172] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L172] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L190] RET updateVariables() [L191] CALL step() [L61] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=31/2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L64] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L65] EXPR var_1_26 << ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=10, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L65] COND TRUE (var_1_27 * var_1_24) >= (var_1_26 << ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31)))) [L66] var_1_30 = (var_1_31 - var_1_32) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L70] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=0, var_1_36=1, var_1_37=6/5, var_1_5=-256] [L75] var_1_35 = var_1_31 [L76] var_1_36 = ((((((((var_1_31) > (var_1_27)) ? (var_1_31) : (var_1_27)))) < (var_1_26)) ? (((((var_1_31) > (var_1_27)) ? (var_1_31) : (var_1_27)))) : (var_1_26))) [L77] var_1_37 = var_1_29 [L78] signed long int stepLocal_2 = last_1_var_1_5; [L79] unsigned char stepLocal_1 = last_1_var_1_10; [L80] signed long int stepLocal_0 = 256; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_1=0, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L81] COND FALSE !(stepLocal_1 && (last_1_var_1_5 >= last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_2=-256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L86] COND TRUE last_1_var_1_1 >= stepLocal_2 [L87] var_1_1 = last_1_var_1_5 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L92] var_1_10 = (last_1_var_1_10 && var_1_11) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L93] COND FALSE !(var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=4000003/4, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L98] var_1_22 = last_1_var_1_22 [L99] var_1_23 = var_1_14 [L100] unsigned char stepLocal_5 = var_1_10; [L101] unsigned char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_4=51, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L102] COND TRUE var_1_22 < stepLocal_4 [L103] var_1_19 = last_1_var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=100, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L111] var_1_21 = var_1_22 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=3999/4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L112] COND TRUE ! (var_1_23 <= var_1_7) [L113] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L121] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_3=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L122] COND FALSE !(var_1_10 && stepLocal_3) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=-256] [L125] COND TRUE (var_1_7 - var_1_8) > var_1_12 [L126] var_1_5 = var_1_19 VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, stepLocal_0=256, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=5] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((((last_1_var_1_10 && (last_1_var_1_5 >= last_1_var_1_1)) ? ((256 != last_1_var_1_5) ? (var_1_1 == ((signed long int) (last_1_var_1_1 + last_1_var_1_5))) : 1) : ((last_1_var_1_1 >= last_1_var_1_5) ? (var_1_1 == ((signed long int) last_1_var_1_5)) : (var_1_1 == ((signed long int) last_1_var_1_1)))) && ((var_1_10 && var_1_10) ? (var_1_5 == ((signed short int) ((((var_1_19) < (-100)) ? (var_1_19) : (-100))))) : (((var_1_7 - var_1_8) > var_1_12) ? (var_1_5 == ((signed short int) var_1_19)) : (var_1_5 == ((signed short int) var_1_19))))) && (var_1_10 == ((unsigned char) (last_1_var_1_10 && var_1_11)))) && ((! (var_1_23 <= var_1_7)) ? (var_1_12 == ((float) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) : (((((((var_1_1) > (var_1_17)) ? (var_1_1) : (var_1_17))) / var_1_15) < var_1_19) ? (var_1_12 == ((float) var_1_13)) : (var_1_12 == ((float) (var_1_16 + 49.6f)))))) && ((var_1_8 != ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) ? (var_1_10 ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : 1)) && ((var_1_22 < var_1_18) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (((var_1_10 || var_1_10) || var_1_10) ? (var_1_19 == ((unsigned short int) last_1_var_1_19)) : (var_1_19 == ((unsigned short int) var_1_22))))) && (var_1_21 == ((signed long int) var_1_22))) && (var_1_22 == ((signed short int) last_1_var_1_22))) && (var_1_23 == ((double) var_1_14)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=0, last_1_var_1_19=5, last_1_var_1_1=-256, last_1_var_1_22=50, last_1_var_1_5=-256, var_1_10=0, var_1_11=0, var_1_12=4, var_1_13=4, var_1_14=3, var_1_15=18, var_1_17=16, var_1_18=51, var_1_19=5, var_1_1=-256, var_1_21=50, var_1_22=50, var_1_23=3, var_1_24=16, var_1_25=0, var_1_26=0, var_1_27=-4294967295, var_1_28=2, var_1_29=2, var_1_30=1, var_1_31=1, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1, var_1_36=0, var_1_37=2, var_1_5=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 506 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 353 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=122occurred in iteration=2, InterpolantAutomatonStates: 9, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 650 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3600/3600 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 08:23:49,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodesize_ps-cn-25_file-25.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 a0009a7cc532886ea56e5f181eee8768048a166795586f8a0c5ab4cb16269407 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:23:52,062 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:23:52,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:23:52,150 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:23:52,150 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:23:52,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:23:52,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:23:52,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:23:52,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:23:52,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:23:52,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:23:52,185 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:23:52,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:23:52,186 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:23:52,186 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:23:52,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:23:52,187 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:23:52,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:23:52,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:23:52,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:23:52,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:23:52,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:23:52,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:23:52,190 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:23:52,190 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:23:52,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:23:52,191 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:23:52,191 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:23:52,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:23:52,192 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:23:52,192 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:23:52,193 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:23:52,193 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:23:52,193 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:23:52,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:23:52,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:23:52,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:23:52,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:23:52,195 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:23:52,195 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:23:52,196 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:23:52,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:23:52,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:23:52,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:23:52,200 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:23:52,200 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 -> a0009a7cc532886ea56e5f181eee8768048a166795586f8a0c5ab4cb16269407 [2024-10-11 08:23:52,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:23:52,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:23:52,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:23:52,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:23:52,590 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:23:52,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:54,341 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:23:54,608 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:23:54,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:54,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/772925f65/6a281ac946db4be9b9d31a3a06a97219/FLAGe06dd6408 [2024-10-11 08:23:54,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/772925f65/6a281ac946db4be9b9d31a3a06a97219 [2024-10-11 08:23:54,645 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:23:54,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:23:54,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:23:54,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:23:54,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:23:54,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:54" (1/1) ... [2024-10-11 08:23:54,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f11dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:54, skipping insertion in model container [2024-10-11 08:23:54,656 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:23:54" (1/1) ... [2024-10-11 08:23:54,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:23:54,867 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_fillercode_fillercodesize_ps-cn-25_file-25.i[915,928] [2024-10-11 08:23:54,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:23:54,994 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:23:55,009 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_fillercode_fillercodesize_ps-cn-25_file-25.i[915,928] [2024-10-11 08:23:55,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:23:55,090 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:23:55,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55 WrapperNode [2024-10-11 08:23:55,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:23:55,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:23:55,092 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:23:55,092 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:23:55,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,151 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-11 08:23:55,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:23:55,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:23:55,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:23:55,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:23:55,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,199 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 08:23:55,200 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,218 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:23:55,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:23:55,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:23:55,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:23:55,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (1/1) ... [2024-10-11 08:23:55,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:23:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:23:55,270 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 08:23:55,274 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 08:23:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:23:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:23:55,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:23:55,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:23:55,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:23:55,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:23:55,421 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:23:55,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:23:57,432 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 08:23:57,432 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:23:57,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:23:57,494 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:23:57,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:57 BoogieIcfgContainer [2024-10-11 08:23:57,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:23:57,497 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:23:57,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:23:57,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:23:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:23:54" (1/3) ... [2024-10-11 08:23:57,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153adf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:57, skipping insertion in model container [2024-10-11 08:23:57,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:23:55" (2/3) ... [2024-10-11 08:23:57,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153adf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:23:57, skipping insertion in model container [2024-10-11 08:23:57,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:23:57" (3/3) ... [2024-10-11 08:23:57,503 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-25.i [2024-10-11 08:23:57,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:23:57,539 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:23:57,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:23:57,626 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;@7c32cce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:23:57,627 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:23:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:23:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 08:23:57,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:57,649 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:57,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:57,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash -28303616, now seen corresponding path program 1 times [2024-10-11 08:23:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:23:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637660637] [2024-10-11 08:23:57,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:57,666 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 08:23:57,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:23:57,668 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 08:23:57,670 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 08:23:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:58,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:23:58,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:23:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 588 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 08:23:58,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:23:58,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:23:58,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637660637] [2024-10-11 08:23:58,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637660637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:23:58,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:23:58,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:23:58,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51697740] [2024-10-11 08:23:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:23:58,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:23:58,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:23:58,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:23:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:23:58,135 INFO L87 Difference]: Start difference. First operand has 74 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 08:23:58,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:23:58,429 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-11 08:23:58,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:23:58,448 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 160 [2024-10-11 08:23:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:23:58,455 INFO L225 Difference]: With dead ends: 145 [2024-10-11 08:23:58,455 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 08:23:58,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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 08:23:58,462 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:23:58,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:23:58,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 08:23:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 08:23:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-11 08:23:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-11 08:23:58,506 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 160 [2024-10-11 08:23:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:23:58,506 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-11 08:23:58,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-11 08:23:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-11 08:23:58,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 08:23:58,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:58,513 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:58,527 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 08:23:58,713 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 08:23:58,714 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:58,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:58,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1426637242, now seen corresponding path program 1 times [2024-10-11 08:23:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:23:58,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109119988] [2024-10-11 08:23:58,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:58,717 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 08:23:58,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:23:58,719 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 08:23:58,721 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 08:23:59,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:59,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:23:59,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:23:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 08:23:59,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:23:59,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:23:59,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109119988] [2024-10-11 08:23:59,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109119988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:23:59,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:23:59,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:23:59,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432192197] [2024-10-11 08:23:59,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:23:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:23:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:23:59,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:23:59,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:23:59,075 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:23:59,424 INFO L93 Difference]: Finished difference Result 192 states and 294 transitions. [2024-10-11 08:23:59,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:23:59,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2024-10-11 08:23:59,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:23:59,429 INFO L225 Difference]: With dead ends: 192 [2024-10-11 08:23:59,432 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 08:23:59,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:23:59,437 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 71 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:23:59,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:23:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 08:23:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-10-11 08:23:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:23:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 181 transitions. [2024-10-11 08:23:59,472 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 181 transitions. Word has length 160 [2024-10-11 08:23:59,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:23:59,473 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 181 transitions. [2024-10-11 08:23:59,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:23:59,473 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 181 transitions. [2024-10-11 08:23:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 08:23:59,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:23:59,479 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:23:59,492 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 (3)] Ended with exit code 0 [2024-10-11 08:23:59,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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 08:23:59,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:23:59,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:23:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash 874185348, now seen corresponding path program 1 times [2024-10-11 08:23:59,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:23:59,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616121263] [2024-10-11 08:23:59,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:23:59,682 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 08:23:59,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:23:59,684 INFO L229 MonitoredProcess]: Starting monitored process 4 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 08:23:59,691 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 (4)] Waiting until timeout for monitored process [2024-10-11 08:23:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:23:59,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:23:59,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:24:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-11 08:24:00,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:24:00,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:24:00,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616121263] [2024-10-11 08:24:00,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616121263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:24:00,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:24:00,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:24:00,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555498666] [2024-10-11 08:24:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:24:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:24:00,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:24:00,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:24:00,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:24:00,526 INFO L87 Difference]: Start difference. First operand 118 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:24:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:24:01,337 INFO L93 Difference]: Finished difference Result 233 states and 357 transitions. [2024-10-11 08:24:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:24:01,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 160 [2024-10-11 08:24:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:24:01,359 INFO L225 Difference]: With dead ends: 233 [2024-10-11 08:24:01,359 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 08:24:01,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:24:01,361 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 86 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 08:24:01,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 187 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 08:24:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 08:24:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 08:24:01,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 77 states have internal predecessors, (97), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 08:24:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-10-11 08:24:01,381 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 160 [2024-10-11 08:24:01,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:24:01,382 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-11 08:24:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-11 08:24:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2024-10-11 08:24:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 08:24:01,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:24:01,385 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:24:01,397 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 (4)] Ended with exit code 0 [2024-10-11 08:24:01,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 08:24:01,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:24:01,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:24:01,586 INFO L85 PathProgramCache]: Analyzing trace with hash -767424641, now seen corresponding path program 1 times [2024-10-11 08:24:01,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:24:01,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909549661] [2024-10-11 08:24:01,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:24:01,587 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 08:24:01,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:24:01,589 INFO L229 MonitoredProcess]: Starting monitored process 5 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 08:24:01,590 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 (5)] Waiting until timeout for monitored process [2024-10-11 08:24:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:24:01,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 08:24:01,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:04,932 WARN L286 SmtUtils]: Spent 13.43s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)