./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_codestructure_normal_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:28:00,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:28:00,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:28:00,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:28:00,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:28:00,384 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:28:00,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:28:00,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:28:00,386 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:28:00,386 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:28:00,386 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:28:00,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:28:00,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:28:00,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:28:00,388 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:28:00,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:28:00,389 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:28:00,389 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:28:00,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:28:00,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:28:00,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:28:00,393 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:28:00,393 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:28:00,393 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:28:00,393 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:28:00,394 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:28:00,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:28:00,394 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:28:00,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:28:00,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:28:00,395 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:28:00,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:28:00,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:00,402 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:28:00,402 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:28:00,402 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:28:00,402 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:28:00,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:28:00,403 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:28:00,403 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:28:00,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:28:00,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:28:00,404 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 [2024-11-20 02:28:00,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:28:00,695 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:28:00,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:28:00,699 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:28:00,700 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:28:00,701 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2024-11-20 02:28:02,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:28:02,348 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:28:02,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2024-11-20 02:28:02,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7fa1198/83389f07fd62491fbed87536b2fc629f/FLAGbae8b4841 [2024-11-20 02:28:02,372 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7fa1198/83389f07fd62491fbed87536b2fc629f [2024-11-20 02:28:02,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:28:02,376 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:28:02,377 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:02,377 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:28:02,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:28:02,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342cd45a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02, skipping insertion in model container [2024-11-20 02:28:02,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:28:02,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2024-11-20 02:28:02,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:02,729 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:28:02,742 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2024-11-20 02:28:02,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:02,823 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:28:02,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02 WrapperNode [2024-11-20 02:28:02,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:02,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:02,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:28:02,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:28:02,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,892 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-11-20 02:28:02,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:02,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:28:02,895 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:28:02,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:28:02,905 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,945 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:28:02,948 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,948 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:28:02,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:28:02,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:28:02,976 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:28:02,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (1/1) ... [2024-11-20 02:28:02,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:02,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:28:03,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:28:03,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:28:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:28:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:28:03,062 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:28:03,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:28:03,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:28:03,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:28:03,159 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:28:03,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:28:03,485 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-20 02:28:03,485 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:28:03,498 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:28:03,498 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:28:03,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:03 BoogieIcfgContainer [2024-11-20 02:28:03,499 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:28:03,501 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:28:03,501 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:28:03,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:28:03,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:28:02" (1/3) ... [2024-11-20 02:28:03,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bec70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:03, skipping insertion in model container [2024-11-20 02:28:03,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:02" (2/3) ... [2024-11-20 02:28:03,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bec70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:03, skipping insertion in model container [2024-11-20 02:28:03,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:03" (3/3) ... [2024-11-20 02:28:03,508 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-43.i [2024-11-20 02:28:03,524 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:28:03,525 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:28:03,589 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:28:03,599 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;@2e133b2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:28:03,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:28:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 02:28:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 02:28:03,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:03,626 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:03,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:03,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1162829343, now seen corresponding path program 1 times [2024-11-20 02:28:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813760899] [2024-11-20 02:28:03,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:28:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 02:28:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 02:28:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 02:28:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 02:28:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 02:28:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 02:28:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 02:28:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 02:28:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:28:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:28:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:28:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:28:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 02:28:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 02:28:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 02:28:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 02:28:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 02:28:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 02:28:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:28:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 02:28:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 02:28:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 02:28:04,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 02:28:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 02:28:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 02:28:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 02:28:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 02:28:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 02:28:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 02:28:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 02:28:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 02:28:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 02:28:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 02:28:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:28:04,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813760899] [2024-11-20 02:28:04,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813760899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:28:04,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:28:04,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:28:04,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518399426] [2024-11-20 02:28:04,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:28:04,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:28:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:28:04,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:28:04,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:04,210 INFO L87 Difference]: Start difference. First operand has 89 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 02:28:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:28:04,248 INFO L93 Difference]: Finished difference Result 171 states and 303 transitions. [2024-11-20 02:28:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:28:04,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 203 [2024-11-20 02:28:04,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:28:04,261 INFO L225 Difference]: With dead ends: 171 [2024-11-20 02:28:04,261 INFO L226 Difference]: Without dead ends: 85 [2024-11-20 02:28:04,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:04,272 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:28:04,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:28:04,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-20 02:28:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-20 02:28:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 02:28:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 131 transitions. [2024-11-20 02:28:04,330 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 131 transitions. Word has length 203 [2024-11-20 02:28:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:28:04,330 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 131 transitions. [2024-11-20 02:28:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 02:28:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 131 transitions. [2024-11-20 02:28:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 02:28:04,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:04,338 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:04,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:28:04,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:04,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1575071199, now seen corresponding path program 1 times [2024-11-20 02:28:04,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226131718] [2024-11-20 02:28:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:28:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 02:28:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 02:28:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 02:28:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 02:28:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-20 02:28:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 02:28:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-20 02:28:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 02:28:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-20 02:28:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 02:28:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-20 02:28:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 02:28:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-20 02:28:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 02:28:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 02:28:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 02:28:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 02:28:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 02:28:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-20 02:28:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 02:28:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-20 02:28:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 02:28:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-20 02:28:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-20 02:28:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-20 02:28:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 02:28:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-20 02:28:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 02:28:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 02:28:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-20 02:28:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-20 02:28:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-20 02:28:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-20 02:28:04,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:28:04,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226131718] [2024-11-20 02:28:04,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226131718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:28:04,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:28:04,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:28:04,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844363784] [2024-11-20 02:28:04,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:28:04,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:28:04,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:28:04,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:28:04,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:28:04,853 INFO L87 Difference]: Start difference. First operand 85 states and 131 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 02:28:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:28:04,894 INFO L93 Difference]: Finished difference Result 168 states and 261 transitions. [2024-11-20 02:28:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:28:04,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-11-20 02:28:04,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:28:04,899 INFO L225 Difference]: With dead ends: 168 [2024-11-20 02:28:04,901 INFO L226 Difference]: Without dead ends: 86 [2024-11-20 02:28:04,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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-11-20 02:28:04,905 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:28:04,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:28:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-20 02:28:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-20 02:28:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 02:28:04,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 132 transitions. [2024-11-20 02:28:04,927 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 132 transitions. Word has length 203 [2024-11-20 02:28:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:28:04,929 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 132 transitions. [2024-11-20 02:28:04,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-20 02:28:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 132 transitions. [2024-11-20 02:28:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-20 02:28:04,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:04,936 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:04,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:28:04,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:04,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:04,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1316905761, now seen corresponding path program 1 times [2024-11-20 02:28:04,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:28:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055558353] [2024-11-20 02:28:04,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:04,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:28:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:28:05,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:28:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:28:05,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:28:05,336 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:28:05,337 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:28:05,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:28:05,344 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 02:28:05,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:28:05,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:28:05 BoogieIcfgContainer [2024-11-20 02:28:05,487 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:28:05,488 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:28:05,488 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:28:05,488 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:28:05,489 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:03" (3/4) ... [2024-11-20 02:28:05,491 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:28:05,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:28:05,494 INFO L158 Benchmark]: Toolchain (without parser) took 3118.25ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 93.9MB in the beginning and 148.8MB in the end (delta: -54.9MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,494 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:28:05,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.95ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 131.5MB in the end (delta: -37.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.22ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 128.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,495 INFO L158 Benchmark]: Boogie Preprocessor took 82.27ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 125.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,496 INFO L158 Benchmark]: RCFGBuilder took 522.60ms. Allocated memory is still 163.6MB. Free memory was 124.6MB in the beginning and 102.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,496 INFO L158 Benchmark]: TraceAbstraction took 1986.59ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 102.2MB in the beginning and 148.8MB in the end (delta: -46.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-20 02:28:05,496 INFO L158 Benchmark]: Witness Printer took 5.86ms. Allocated memory is still 220.2MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:28:05,502 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 163.6MB. Free memory was 120.6MB in the beginning and 120.5MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.95ms. Allocated memory is still 163.6MB. Free memory was 93.8MB in the beginning and 131.5MB in the end (delta: -37.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.22ms. Allocated memory is still 163.6MB. Free memory was 131.5MB in the beginning and 128.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.27ms. Allocated memory is still 163.6MB. Free memory was 128.8MB in the beginning and 125.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 522.60ms. Allocated memory is still 163.6MB. Free memory was 124.6MB in the beginning and 102.8MB in the end (delta: 21.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1986.59ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 102.2MB in the beginning and 148.8MB in the end (delta: -46.6MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Witness Printer took 5.86ms. Allocated memory is still 220.2MB. Free memory is still 148.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed long int var_1_8 = -1; [L30] signed long int var_1_9 = 50; [L31] signed char var_1_10 = 64; [L32] signed short int var_1_11 = 5; [L33] unsigned short int var_1_12 = 4; [L34] unsigned char var_1_13 = 1; [L35] unsigned short int var_1_14 = 49632; [L36] unsigned short int var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 128.5; [L39] signed char var_1_18 = 2; [L40] signed char var_1_19 = 25; [L41] signed char var_1_20 = 10; [L42] signed char var_1_21 = 1; [L43] signed char var_1_22 = 8; [L44] unsigned long int var_1_23 = 25; [L45] unsigned short int var_1_24 = 32; [L46] unsigned long int var_1_25 = 16; [L47] signed long int var_1_26 = 50; VAL [isInitial=0, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L89] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L90] var_1_3 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L91] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L92] var_1_4 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L93] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L94] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L95] var_1_5 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L96] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_6=631/10, var_1_7=32, var_1_8=-1, var_1_9=50] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=-1, var_1_9=50] [L99] var_1_8 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L100] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L101] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=50] [L102] var_1_9 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L104] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L105] var_1_10 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L107] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L108] var_1_13 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L110] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L111] var_1_14 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L113] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L114] var_1_15 = __VERIFIER_nondet_ushort() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L116] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_17=257/2, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L117] var_1_17 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L119] var_1_18 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L122] var_1_19 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L125] var_1_20 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L128] var_1_21 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L130] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=8, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L131] var_1_22 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L132] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L134] var_1_24 = __VERIFIER_nondet_ushort() [L135] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L136] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=16, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L137] var_1_25 = __VERIFIER_nondet_ulong() [L138] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] CALL assume_abort_if_not(var_1_25 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_25 <= 4294967294) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=5003/5, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_7=32, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L51] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L52] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] EXPR var_1_8 & var_1_9 VAL [isInitial=1, var_1_10=-16, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L56] COND FALSE !(-4 > (var_1_8 & var_1_9)) [L59] COND FALSE !(var_1_1 > var_1_4) [L62] var_1_11 = ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L64] COND TRUE \read(var_1_13) [L65] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L67] COND TRUE var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1) [L68] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=25, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L76] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L77] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L81] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L144-L145] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_8 & var_1_9)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((var_1_7) < (((16 - 32) + (64 + var_1_10)))) ? (var_1_7) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_2 <= (((((var_1_3) < (var_1_17)) ? (var_1_3) : (var_1_17))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_25)) ? (var_1_14) : (var_1_25))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < var_1_9) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-16, var_1_11=32, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=-16, var_1_18=-8, var_1_19=-8, var_1_1=49637, var_1_20=-8, var_1_21=126, var_1_22=0, var_1_23=32754, var_1_24=32750, var_1_25=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 385 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 124 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7 IncrementalHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 261 mSDtfsCounter, 7 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 170 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 4224/4224 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:28:05,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:28:07,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:28:07,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:28:07,801 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:28:07,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:28:07,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:28:07,833 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:28:07,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:28:07,834 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:28:07,836 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:28:07,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:28:07,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:28:07,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:28:07,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:28:07,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:28:07,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:28:07,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:28:07,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:28:07,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:28:07,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:28:07,843 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:28:07,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:28:07,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:28:07,844 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:28:07,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:28:07,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:28:07,846 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:28:07,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:28:07,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:28:07,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:28:07,847 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:28:07,848 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:28:07,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:28:07,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:28:07,849 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:07,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:28:07,850 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:28:07,850 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:28:07,850 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:28:07,851 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:28:07,851 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:28:07,851 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:28:07,851 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:28:07,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:28:07,852 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a1c694b535a0db632a25942de489387c8249c42f83b73f06ffeb76130c0a4677 [2024-11-20 02:28:08,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:28:08,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:28:08,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:28:08,194 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:28:08,194 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:28:08,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2024-11-20 02:28:09,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:28:09,989 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:28:09,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i [2024-11-20 02:28:10,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2318a16/9b403c7f97004e53874579b306cbc074/FLAGd48416a63 [2024-11-20 02:28:10,013 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f2318a16/9b403c7f97004e53874579b306cbc074 [2024-11-20 02:28:10,015 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:28:10,017 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:28:10,018 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:10,018 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:28:10,025 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:28:10,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b88c6c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10, skipping insertion in model container [2024-11-20 02:28:10,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:28:10,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2024-11-20 02:28:10,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:10,362 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:28:10,373 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-43.i[913,926] [2024-11-20 02:28:10,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:28:10,440 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:28:10,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10 WrapperNode [2024-11-20 02:28:10,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:28:10,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:10,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:28:10,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:28:10,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,510 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-20 02:28:10,513 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:28:10,514 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:28:10,514 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:28:10,514 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:28:10,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,538 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,561 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:28:10,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,574 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:28:10,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:28:10,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:28:10,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:28:10,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (1/1) ... [2024-11-20 02:28:10,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:28:10,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:28:10,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:28:10,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:28:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:28:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:28:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:28:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:28:10,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:28:10,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:28:10,786 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:28:10,788 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:28:20,876 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:28:20,876 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:28:20,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:28:20,895 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:28:20,896 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:20 BoogieIcfgContainer [2024-11-20 02:28:20,896 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:28:20,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:28:20,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:28:20,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:28:20,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:28:10" (1/3) ... [2024-11-20 02:28:20,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a4034c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:20, skipping insertion in model container [2024-11-20 02:28:20,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:28:10" (2/3) ... [2024-11-20 02:28:20,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37a4034c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:28:20, skipping insertion in model container [2024-11-20 02:28:20,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:28:20" (3/3) ... [2024-11-20 02:28:20,905 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-43.i [2024-11-20 02:28:20,920 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:28:20,920 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:28:20,987 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:28:20,993 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;@2ca9335e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:28:20,994 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:28:20,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 02:28:21,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-20 02:28:21,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:21,011 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:21,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1930671262, now seen corresponding path program 1 times [2024-11-20 02:28:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:28:21,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595052601] [2024-11-20 02:28:21,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:21,028 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:28:21,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:28:21,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:28:21,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:28:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:21,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:28:21,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:28:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2024-11-20 02:28:21,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:28:21,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:28:21,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595052601] [2024-11-20 02:28:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595052601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:28:21,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:28:21,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:28:21,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383428812] [2024-11-20 02:28:21,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:28:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:28:21,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:28:21,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:28:21,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:21,693 INFO L87 Difference]: Start difference. First operand has 80 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 states have internal predecessors, (58), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 02:28:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:28:21,724 INFO L93 Difference]: Finished difference Result 153 states and 275 transitions. [2024-11-20 02:28:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:28:21,727 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 200 [2024-11-20 02:28:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:28:21,733 INFO L225 Difference]: With dead ends: 153 [2024-11-20 02:28:21,733 INFO L226 Difference]: Without dead ends: 76 [2024-11-20 02:28:21,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:28:21,740 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:28:21,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:28:21,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-20 02:28:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-20 02:28:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-20 02:28:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-11-20 02:28:21,790 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 200 [2024-11-20 02:28:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:28:21,790 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-11-20 02:28:21,791 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, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-20 02:28:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-11-20 02:28:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-20 02:28:21,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:28:21,795 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:28:21,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:28:21,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:28:21,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:28:21,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:28:21,997 INFO L85 PathProgramCache]: Analyzing trace with hash 132059100, now seen corresponding path program 1 times [2024-11-20 02:28:21,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:28:21,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472474010] [2024-11-20 02:28:21,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:28:21,999 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:28:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:28:22,001 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:28:22,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:28:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:28:22,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 02:28:22,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:28:46,954 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 02:28:55,448 WARN L286 SmtUtils]: Spent 7.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 02:29:09,009 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (or (and (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse1)) (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (and (fp.geq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse1))) (fp.leq c_~var_1_5~0 ((_ to_fp 11 53) c_currentRoundingMode (fp.neg .cse2)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2024-11-20 02:29:14,579 WARN L286 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-20 02:29:29,106 WARN L286 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)