./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodesize_ps-cn-10_file-96.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 e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:20:37,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:20:37,535 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 08:20:37,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:20:37,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:20:37,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:20:37,583 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:20:37,583 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:20:37,584 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:20:37,585 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:20:37,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:20:37,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:20:37,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:20:37,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:20:37,589 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:20:37,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:20:37,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:20:37,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:20:37,593 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 08:20:37,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:20:37,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:20:37,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:20:37,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:20:37,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:20:37,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:20:37,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:20:37,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:20:37,596 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:20:37,596 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:20:37,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:20:37,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:20:37,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:20:37,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:20:37,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:20:37,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:20:37,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:20:37,599 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 08:20:37,599 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 08:20:37,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:20:37,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:20:37,600 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:20:37,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:20:37,600 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 -> e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d [2024-10-14 08:20:37,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:20:37,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:20:37,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:20:37,880 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:20:37,881 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:20:37,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:39,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:20:39,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:20:39,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:39,544 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daeb4219/f423d743d2c74db8918ba78639ec4941/FLAGe96fa3a1f [2024-10-14 08:20:39,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3daeb4219/f423d743d2c74db8918ba78639ec4941 [2024-10-14 08:20:39,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:20:39,566 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:20:39,568 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:20:39,569 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:20:39,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:20:39,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:39,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fc4ad0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39, skipping insertion in model container [2024-10-14 08:20:39,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:39,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:20:39,778 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-14 08:20:39,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:20:39,887 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:20:39,902 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-14 08:20:39,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:20:39,965 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:20:39,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39 WrapperNode [2024-10-14 08:20:39,966 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:20:39,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:20:39,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:20:39,968 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:20:39,976 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:39,991 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,048 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2024-10-14 08:20:40,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:20:40,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:20:40,052 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:20:40,052 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:20:40,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,066 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,089 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 08:20:40,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,109 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,120 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,122 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:20:40,127 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:20:40,127 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:20:40,127 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:20:40,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (1/1) ... [2024-10-14 08:20:40,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:20:40,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:20:40,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:20:40,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:20:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:20:40,228 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:20:40,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:20:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 08:20:40,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:20:40,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:20:40,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:20:40,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:20:40,751 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 08:20:40,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:20:40,801 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:20:40,802 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:20:40,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:40 BoogieIcfgContainer [2024-10-14 08:20:40,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:20:40,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:20:40,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:20:40,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:20:40,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:20:39" (1/3) ... [2024-10-14 08:20:40,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a02db25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:40, skipping insertion in model container [2024-10-14 08:20:40,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:39" (2/3) ... [2024-10-14 08:20:40,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a02db25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:40, skipping insertion in model container [2024-10-14 08:20:40,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:40" (3/3) ... [2024-10-14 08:20:40,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:40,834 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:20:40,835 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:20:40,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:20:40,934 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;@77254e5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:20:40,935 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:20:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 08:20:40,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 08:20:40,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:40,970 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:40,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:40,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:40,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1549707772, now seen corresponding path program 1 times [2024-10-14 08:20:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:20:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448158675] [2024-10-14 08:20:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:40,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:20:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:20:41,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:20:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:20:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:20:41,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:20:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:20:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:20:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:20:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:20:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:20:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:20:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:20:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:20:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:20:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:20:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:20:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:20:41,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:20:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:20:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:20:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:20:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:20:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:20:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:20:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:20:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 08:20:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 08:20:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:20:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 08:20:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:20:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 08:20:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:20:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:20:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 08:20:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 08:20:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 08:20:41,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:20:41,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448158675] [2024-10-14 08:20:41,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448158675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:20:41,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:20:41,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:20:41,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840054465] [2024-10-14 08:20:41,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:20:41,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:20:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:20:41,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:20:41,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:20:41,641 INFO L87 Difference]: Start difference. First operand has 85 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 48 states have internal predecessors, (65), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 08:20:41,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:20:41,704 INFO L93 Difference]: Finished difference Result 164 states and 297 transitions. [2024-10-14 08:20:41,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:20:41,708 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 211 [2024-10-14 08:20:41,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:20:41,718 INFO L225 Difference]: With dead ends: 164 [2024-10-14 08:20:41,719 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 08:20:41,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:20:41,729 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:20:41,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:20:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 08:20:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 08:20:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 08:20:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-10-14 08:20:41,795 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 211 [2024-10-14 08:20:41,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:20:41,796 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-10-14 08:20:41,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 08:20:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-10-14 08:20:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 08:20:41,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:41,804 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:41,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 08:20:41,806 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:41,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1945529590, now seen corresponding path program 1 times [2024-10-14 08:20:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:20:41,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351972408] [2024-10-14 08:20:41,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:41,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:20:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:20:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:20:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:20:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:20:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:20:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:20:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:20:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:20:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:20:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:20:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:20:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:20:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:20:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:20:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:20:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:20:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:20:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:20:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:20:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:20:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:20:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:20:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:20:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:20:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:20:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 08:20:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 08:20:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:20:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 08:20:42,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:20:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 08:20:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:20:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:20:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 08:20:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 08:20:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 08:20:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:20:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351972408] [2024-10-14 08:20:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351972408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:20:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:20:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:20:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543444698] [2024-10-14 08:20:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:20:42,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 08:20:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:20:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 08:20:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:20:42,347 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:20:42,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:20:42,393 INFO L93 Difference]: Finished difference Result 160 states and 245 transitions. [2024-10-14 08:20:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 08:20:42,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-10-14 08:20:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:20:42,397 INFO L225 Difference]: With dead ends: 160 [2024-10-14 08:20:42,397 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 08:20:42,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 08:20:42,402 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:20:42,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 08:20:42,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 08:20:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-14 08:20:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 08:20:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 123 transitions. [2024-10-14 08:20:42,425 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 123 transitions. Word has length 211 [2024-10-14 08:20:42,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:20:42,427 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 123 transitions. [2024-10-14 08:20:42,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:20:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 123 transitions. [2024-10-14 08:20:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 08:20:42,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:42,435 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:42,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 08:20:42,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:42,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1687364152, now seen corresponding path program 1 times [2024-10-14 08:20:42,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:20:42,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402600936] [2024-10-14 08:20:42,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:42,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:20:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:20:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:20:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:20:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:20:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:20:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:20:42,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:20:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:20:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:20:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:20:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:20:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:20:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:20:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:20:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:20:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:20:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:20:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:20:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:20:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:20:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:20:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:20:42,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:20:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:20:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:20:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 08:20:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 08:20:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:20:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 08:20:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:20:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 08:20:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:20:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:20:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 08:20:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 08:20:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 08:20:43,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:20:43,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402600936] [2024-10-14 08:20:43,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402600936] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:20:43,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:20:43,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 08:20:43,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270442809] [2024-10-14 08:20:43,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:20:43,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:20:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:20:43,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:20:43,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:20:43,004 INFO L87 Difference]: Start difference. First operand 81 states and 123 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:20:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:20:43,272 INFO L93 Difference]: Finished difference Result 242 states and 368 transitions. [2024-10-14 08:20:43,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:20:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 211 [2024-10-14 08:20:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:20:43,277 INFO L225 Difference]: With dead ends: 242 [2024-10-14 08:20:43,279 INFO L226 Difference]: Without dead ends: 162 [2024-10-14 08:20:43,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:20:43,282 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 66 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:20:43,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 349 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 08:20:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-14 08:20:43,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2024-10-14 08:20:43,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 1.16) internal successors, (87), 75 states have internal predecessors, (87), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 08:20:43,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2024-10-14 08:20:43,333 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 211 [2024-10-14 08:20:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:20:43,334 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2024-10-14 08:20:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:20:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2024-10-14 08:20:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 08:20:43,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:43,341 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:43,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 08:20:43,342 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:43,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:43,342 INFO L85 PathProgramCache]: Analyzing trace with hash -986299574, now seen corresponding path program 1 times [2024-10-14 08:20:43,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:20:43,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850551453] [2024-10-14 08:20:43,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:43,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:20:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 08:20:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 08:20:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 08:20:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 08:20:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 08:20:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 08:20:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 08:20:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 08:20:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 08:20:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 08:20:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 08:20:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 08:20:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 08:20:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 08:20:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 08:20:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 08:20:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 08:20:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 08:20:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 08:20:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 08:20:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 08:20:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 08:20:43,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 08:20:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 08:20:43,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 08:20:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 08:20:43,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 08:20:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 08:20:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 08:20:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 08:20:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 08:20:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 08:20:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 08:20:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 08:20:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-14 08:20:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 30 proven. 72 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-10-14 08:20:43,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 08:20:43,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850551453] [2024-10-14 08:20:43,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850551453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:20:43,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974697407] [2024-10-14 08:20:43,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:43,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:20:43,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:20:44,001 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 08:20:44,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 08:20:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:44,156 INFO L255 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 08:20:44,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:20:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1502 proven. 177 refuted. 0 times theorem prover too weak. 701 trivial. 0 not checked. [2024-10-14 08:20:45,346 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:20:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 84 proven. 117 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2024-10-14 08:20:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974697407] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 08:20:45,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 08:20:45,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 21 [2024-10-14 08:20:45,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124876103] [2024-10-14 08:20:45,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 08:20:45,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 08:20:45,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 08:20:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 08:20:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-10-14 08:20:45,820 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2024-10-14 08:20:47,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:20:47,233 INFO L93 Difference]: Finished difference Result 368 states and 518 transitions. [2024-10-14 08:20:47,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-14 08:20:47,234 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) Word has length 211 [2024-10-14 08:20:47,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:20:47,239 INFO L225 Difference]: With dead ends: 368 [2024-10-14 08:20:47,241 INFO L226 Difference]: Without dead ends: 288 [2024-10-14 08:20:47,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 483 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=679, Invalid=1577, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 08:20:47,245 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 191 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 08:20:47,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 512 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 08:20:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-14 08:20:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 262. [2024-10-14 08:20:47,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 141 states have internal predecessors, (153), 105 states have call successors, (105), 16 states have call predecessors, (105), 16 states have return successors, (105), 104 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-14 08:20:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 363 transitions. [2024-10-14 08:20:47,308 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 363 transitions. Word has length 211 [2024-10-14 08:20:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:20:47,309 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 363 transitions. [2024-10-14 08:20:47,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 7 states have call successors, (83), 4 states have call predecessors, (83), 8 states have return successors, (84), 7 states have call predecessors, (84), 7 states have call successors, (84) [2024-10-14 08:20:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 363 transitions. [2024-10-14 08:20:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 08:20:47,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:47,312 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:47,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 08:20:47,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 08:20:47,517 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:47,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash -986239992, now seen corresponding path program 1 times [2024-10-14 08:20:47,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 08:20:47,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513733347] [2024-10-14 08:20:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 08:20:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:20:47,626 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 08:20:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 08:20:47,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 08:20:47,799 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 08:20:47,800 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 08:20:47,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 08:20:47,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 08:20:47,953 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 08:20:47,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 08:20:47 BoogieIcfgContainer [2024-10-14 08:20:47,957 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 08:20:47,958 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 08:20:47,958 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 08:20:47,959 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 08:20:47,959 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:40" (3/4) ... [2024-10-14 08:20:47,961 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 08:20:47,962 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 08:20:47,963 INFO L158 Benchmark]: Toolchain (without parser) took 8396.81ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 127.2MB in the beginning and 166.2MB in the end (delta: -39.0MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,963 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 178.3MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:20:47,963 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.47ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 111.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.26ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 107.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,964 INFO L158 Benchmark]: Boogie Preprocessor took 75.05ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 102.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,964 INFO L158 Benchmark]: RCFGBuilder took 675.52ms. Allocated memory is still 178.3MB. Free memory was 102.0MB in the beginning and 74.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,965 INFO L158 Benchmark]: TraceAbstraction took 7152.16ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 74.1MB in the beginning and 166.2MB in the end (delta: -92.1MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. [2024-10-14 08:20:47,965 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 239.1MB. Free memory is still 166.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 08:20:47,966 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.22ms. Allocated memory is still 178.3MB. Free memory is still 144.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.47ms. Allocated memory is still 178.3MB. Free memory was 127.2MB in the beginning and 111.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.26ms. Allocated memory is still 178.3MB. Free memory was 111.8MB in the beginning and 107.7MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.05ms. Allocated memory is still 178.3MB. Free memory was 107.7MB in the beginning and 102.0MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 675.52ms. Allocated memory is still 178.3MB. Free memory was 102.0MB in the beginning and 74.7MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7152.16ms. Allocated memory was 178.3MB in the beginning and 239.1MB in the end (delta: 60.8MB). Free memory was 74.1MB in the beginning and 166.2MB in the end (delta: -92.1MB). Peak memory consumption was 75.4MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 239.1MB. Free memory is still 166.2MB. 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 someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 2; [L47] unsigned char var_1_35 = 0; [L48] unsigned char var_1_36 = 0; [L49] unsigned char var_1_37 = 1; [L50] unsigned char var_1_38 = 1; [L51] unsigned char var_1_39 = 5; [L52] unsigned char var_1_40 = 0; [L53] unsigned char var_1_41 = 100; [L54] unsigned short int last_1_var_1_9 = 4; [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L174] RET updateLastVariables() [L175] CALL updateVariables() [L108] var_1_4 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L109] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_6=1, var_1_8=-10, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L110] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L111] var_1_6 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L112] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_8=-10, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L113] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=-10, var_1_9=4] [L114] var_1_8 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L115] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L116] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L117] var_1_10 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L118] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L119] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L120] var_1_12 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L121] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L122] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L123] var_1_13 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L124] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L125] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L126] var_1_18 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L127] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L128] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L130] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L131] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L132] var_1_20 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L135] var_1_21 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L138] var_1_22 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L141] var_1_25 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L144] var_1_28 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L146] var_1_29 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L147] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L148] var_1_30 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L150] var_1_33 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L153] var_1_35 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=1, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L156] var_1_37 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_37 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_37 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_37 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_37 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L159] var_1_40 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_40 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_40 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_40 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_40 <= 254) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L59] COND TRUE \read(var_1_35) [L60] var_1_34 = var_1_33 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=0, var_1_37=-255, var_1_38=1, var_1_39=5, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L62] var_1_36 = var_1_37 [L63] var_1_38 = 1 [L64] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L65] EXPR (-1000000000 + var_1_32) & var_1_40 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L65] COND FALSE !(((-1000000000 + var_1_32) & var_1_40) > var_1_33) [L68] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=50, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L71] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L72] COND TRUE \read(var_1_4) [L73] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L77] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=16, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L78] COND FALSE !(var_1_23 < var_1_23) [L89] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L91] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=4] [L92] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L99] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L101] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L104] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=0, var_1_12=-2147368962, var_1_13=32767, var_1_17=-1, var_1_18=126, var_1_19=93, var_1_1=126, var_1_20=63, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=64319, var_1_28=64319, var_1_30=64320, var_1_31=64320, var_1_32=-2, var_1_33=-2, var_1_34=-2, var_1_35=1, var_1_36=-255, var_1_37=-255, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=100, var_1_4=1, var_1_6=1, var_1_8=126, var_1_9=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.9s, OverallIterations: 5, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 1212 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 708 mSDsCounter, 318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 791 IncrementalHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 318 mSolverCounterUnsat, 504 mSDtfsCounter, 791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 787 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=262occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1266 NumberOfCodeBlocks, 1266 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1260 ConstructedInterpolants, 0 QuantifiedInterpolants, 5273 SizeOfPredicates, 6 NumberOfNonLiveVariables, 470 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 13914/14280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 08:20:48,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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_fillercode_fillercodesize_ps-cn-10_file-96.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 e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 08:20:50,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 08:20:50,363 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 08:20:50,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 08:20:50,370 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 08:20:50,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 08:20:50,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 08:20:50,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 08:20:50,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 08:20:50,402 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 08:20:50,403 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 08:20:50,403 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 08:20:50,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 08:20:50,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 08:20:50,404 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 08:20:50,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 08:20:50,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 08:20:50,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 08:20:50,406 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 08:20:50,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 08:20:50,409 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 08:20:50,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 08:20:50,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 08:20:50,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 08:20:50,411 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 08:20:50,411 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 08:20:50,411 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 08:20:50,411 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 08:20:50,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 08:20:50,412 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 08:20:50,412 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 08:20:50,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 08:20:50,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 08:20:50,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 08:20:50,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:20:50,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 08:20:50,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 08:20:50,418 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 08:20:50,419 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 08:20:50,419 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 08:20:50,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 08:20:50,420 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 08:20:50,420 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 08:20:50,420 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 08:20:50,421 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 08:20:50,421 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 -> e3ddf029d6c8d316304cb4ddcdbc5422251d87289b8ada843d8e8cc5a57a2c2d [2024-10-14 08:20:50,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 08:20:50,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 08:20:50,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 08:20:50,787 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 08:20:50,789 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 08:20:50,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:52,387 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 08:20:52,623 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 08:20:52,624 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:52,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d34d9e1ad/a846f35c90dd48be809c85800198dc26/FLAG099042164 [2024-10-14 08:20:52,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d34d9e1ad/a846f35c90dd48be809c85800198dc26 [2024-10-14 08:20:52,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 08:20:52,977 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 08:20:52,978 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 08:20:52,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 08:20:52,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 08:20:52,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:52" (1/1) ... [2024-10-14 08:20:52,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fc2168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:52, skipping insertion in model container [2024-10-14 08:20:52,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 08:20:52" (1/1) ... [2024-10-14 08:20:53,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 08:20:53,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-14 08:20:53,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:20:53,311 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 08:20:53,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-96.i[915,928] [2024-10-14 08:20:53,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 08:20:53,379 INFO L204 MainTranslator]: Completed translation [2024-10-14 08:20:53,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53 WrapperNode [2024-10-14 08:20:53,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 08:20:53,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 08:20:53,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 08:20:53,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 08:20:53,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,430 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-14 08:20:53,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 08:20:53,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 08:20:53,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 08:20:53,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 08:20:53,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,461 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 08:20:53,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,483 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 08:20:53,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 08:20:53,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 08:20:53,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 08:20:53,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (1/1) ... [2024-10-14 08:20:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 08:20:53,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 08:20:53,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 08:20:53,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 08:20:53,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 08:20:53,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 08:20:53,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 08:20:53,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 08:20:53,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 08:20:53,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 08:20:53,648 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 08:20:53,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 08:20:56,844 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 08:20:56,845 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 08:20:56,909 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 08:20:56,909 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 08:20:56,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:56 BoogieIcfgContainer [2024-10-14 08:20:56,910 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 08:20:56,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 08:20:56,912 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 08:20:56,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 08:20:56,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 08:20:52" (1/3) ... [2024-10-14 08:20:56,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ce63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:56, skipping insertion in model container [2024-10-14 08:20:56,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 08:20:53" (2/3) ... [2024-10-14 08:20:56,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@487ce63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 08:20:56, skipping insertion in model container [2024-10-14 08:20:56,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 08:20:56" (3/3) ... [2024-10-14 08:20:56,921 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-96.i [2024-10-14 08:20:56,940 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 08:20:56,941 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 08:20:57,019 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 08:20:57,027 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;@4eaad124, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 08:20:57,027 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 08:20:57,032 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 08:20:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 08:20:57,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:57,052 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:57,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash 116231618, now seen corresponding path program 1 times [2024-10-14 08:20:57,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:20:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944329344] [2024-10-14 08:20:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:57,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:20:57,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:20:57,075 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:20:57,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 08:20:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:57,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 08:20:57,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:20:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1124 proven. 0 refuted. 0 times theorem prover too weak. 1256 trivial. 0 not checked. [2024-10-14 08:20:57,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:20:57,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:20:57,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944329344] [2024-10-14 08:20:57,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944329344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:20:57,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:20:57,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 08:20:57,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679902657] [2024-10-14 08:20:57,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:20:57,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 08:20:57,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:20:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 08:20:57,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:20:57,577 INFO L87 Difference]: Start difference. First operand has 82 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 08:20:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:20:58,570 INFO L93 Difference]: Finished difference Result 158 states and 287 transitions. [2024-10-14 08:20:58,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 08:20:58,592 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 210 [2024-10-14 08:20:58,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:20:58,598 INFO L225 Difference]: With dead ends: 158 [2024-10-14 08:20:58,599 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 08:20:58,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 08:20:58,606 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 08:20:58,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 08:20:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 08:20:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 08:20:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-14 08:20:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-10-14 08:20:58,665 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 210 [2024-10-14 08:20:58,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:20:58,666 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-10-14 08:20:58,666 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, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 08:20:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-10-14 08:20:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 08:20:58,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:20:58,676 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:20:58,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 08:20:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:20:58,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:20:58,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:20:58,879 INFO L85 PathProgramCache]: Analyzing trace with hash -173631492, now seen corresponding path program 1 times [2024-10-14 08:20:58,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:20:58,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526972259] [2024-10-14 08:20:58,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:20:58,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:20:58,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:20:58,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:20:58,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 08:20:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:20:59,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 08:20:59,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:21:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-10-14 08:21:00,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 08:21:00,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:21:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526972259] [2024-10-14 08:21:00,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526972259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 08:21:00,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 08:21:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 08:21:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257232277] [2024-10-14 08:21:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 08:21:00,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 08:21:00,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 08:21:00,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 08:21:00,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 08:21:00,164 INFO L87 Difference]: Start difference. First operand 77 states and 118 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:21:01,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:21:04,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 08:21:04,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 08:21:04,409 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-10-14 08:21:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 08:21:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 210 [2024-10-14 08:21:04,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 08:21:04,435 INFO L225 Difference]: With dead ends: 230 [2024-10-14 08:21:04,435 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 08:21:04,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 08:21:04,437 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 08:21:04,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 337 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 08:21:04,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 08:21:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 140. [2024-10-14 08:21:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 67 states have (on average 1.1492537313432836) internal successors, (77), 67 states have internal predecessors, (77), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 08:21:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2024-10-14 08:21:04,484 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 210 [2024-10-14 08:21:04,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 08:21:04,485 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2024-10-14 08:21:04,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-10-14 08:21:04,486 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2024-10-14 08:21:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 08:21:04,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 08:21:04,496 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 08:21:04,508 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 (3)] Ended with exit code 0 [2024-10-14 08:21:04,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:21:04,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 08:21:04,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 08:21:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 527433086, now seen corresponding path program 1 times [2024-10-14 08:21:04,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 08:21:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950744334] [2024-10-14 08:21:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:21:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 08:21:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 08:21:04,702 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 08:21:04,704 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 (4)] Waiting until timeout for monitored process [2024-10-14 08:21:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:21:04,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 08:21:04,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:21:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1464 proven. 180 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2024-10-14 08:21:06,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 08:21:06,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 08:21:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950744334] [2024-10-14 08:21:06,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950744334] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 08:21:06,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [354997263] [2024-10-14 08:21:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 08:21:06,988 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 08:21:06,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 08:21:06,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 08:21:06,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-10-14 08:21:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 08:21:07,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-10-14 08:21:07,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 08:21:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1014 proven. 72 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2024-10-14 08:21:30,021 INFO L311 TraceCheckSpWp]: Computing backward predicates...