./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.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 a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:40:44,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:40:44,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:40:44,954 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:40:44,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:40:44,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:40:44,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:40:44,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:40:44,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:40:44,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:40:44,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:40:44,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:40:44,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:40:44,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:40:44,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:40:44,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:40:44,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:40:44,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:40:44,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:40:44,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:40:44,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:40:44,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:40:44,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:40:44,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:40:44,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:40:44,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:40:44,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:40:44,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:40:44,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:40:44,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:40:44,990 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:40:44,990 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:40:44,990 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:44,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:40:44,991 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:40:44,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:40:44,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:40:44,992 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 -> a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 [2024-11-08 20:40:45,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:40:45,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:40:45,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:40:45,228 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:40:45,229 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:40:45,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:40:46,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:40:46,852 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:40:46,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:40:46,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881f8ea46/963a2d01b77d469cb62906769881c195/FLAGe8b036b75 [2024-11-08 20:40:47,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881f8ea46/963a2d01b77d469cb62906769881c195 [2024-11-08 20:40:47,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:40:47,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:40:47,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:47,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:40:47,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:40:47,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f9fbc66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47, skipping insertion in model container [2024-11-08 20:40:47,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:40:47,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-08 20:40:47,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:47,498 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:40:47,516 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-08 20:40:47,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:47,569 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:40:47,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47 WrapperNode [2024-11-08 20:40:47,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:47,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:47,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:40:47,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:40:47,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,618 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2024-11-08 20:40:47,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:47,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:40:47,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:40:47,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:40:47,628 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,631 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:40:47,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,656 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:40:47,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:40:47,660 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:40:47,660 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:40:47,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (1/1) ... [2024-11-08 20:40:47,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:47,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:40:47,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:40:47,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:40:47,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:40:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:40:47,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:40:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:40:47,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:40:47,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:40:47,866 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:40:47,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:40:48,143 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:40:48,143 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:40:48,158 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:40:48,158 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:40:48,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:40:48 BoogieIcfgContainer [2024-11-08 20:40:48,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:40:48,164 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:40:48,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:40:48,168 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:40:48,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:40:47" (1/3) ... [2024-11-08 20:40:48,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe3b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:40:48, skipping insertion in model container [2024-11-08 20:40:48,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:47" (2/3) ... [2024-11-08 20:40:48,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe3b8b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:40:48, skipping insertion in model container [2024-11-08 20:40:48,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:40:48" (3/3) ... [2024-11-08 20:40:48,171 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:40:48,184 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:40:48,185 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:40:48,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:40:48,238 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;@218dbede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:40:48,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:40:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:40:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 20:40:48,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:48,259 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:48,259 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:48,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1129952013, now seen corresponding path program 1 times [2024-11-08 20:40:48,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361595433] [2024-11-08 20:40:48,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:48,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:48,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:40:48,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:40:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:40:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 20:40:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:40:48,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:40:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:40:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:40:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:40:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:40:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:40:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:40:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:40:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:40:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:40:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:40:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:40:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:40:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:40:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:40:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:40:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:40:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:40:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:40:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:40:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361595433] [2024-11-08 20:40:48,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361595433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:48,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:40:48,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877662847] [2024-11-08 20:40:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:48,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:40:48,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:48,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:40:48,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:40:48,807 INFO L87 Difference]: Start difference. First operand has 98 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 20:40:48,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:48,837 INFO L93 Difference]: Finished difference Result 188 states and 338 transitions. [2024-11-08 20:40:48,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:40:48,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 223 [2024-11-08 20:40:48,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:48,844 INFO L225 Difference]: With dead ends: 188 [2024-11-08 20:40:48,845 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 20:40:48,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:40:48,852 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:48,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:48,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 20:40:48,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 20:40:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:40:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2024-11-08 20:40:48,945 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 223 [2024-11-08 20:40:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:48,947 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2024-11-08 20:40:48,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 20:40:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2024-11-08 20:40:48,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 20:40:48,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:48,953 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:48,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:40:48,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:48,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -456482795, now seen corresponding path program 1 times [2024-11-08 20:40:48,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:48,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341863956] [2024-11-08 20:40:48,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:49,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:40:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:40:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:40:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 20:40:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:40:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:40:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:40:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:40:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:40:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:40:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:40:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:40:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:40:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:40:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:40:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:40:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:40:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:40:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:40:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:40:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:49,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:40:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:40:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:40:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:40:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:40:49,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:49,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341863956] [2024-11-08 20:40:49,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341863956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:49,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:49,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:40:49,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91475842] [2024-11-08 20:40:49,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:49,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:40:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:49,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:40:49,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:49,265 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:49,307 INFO L93 Difference]: Finished difference Result 201 states and 311 transitions. [2024-11-08 20:40:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:40:49,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-11-08 20:40:49,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:49,312 INFO L225 Difference]: With dead ends: 201 [2024-11-08 20:40:49,314 INFO L226 Difference]: Without dead ends: 111 [2024-11-08 20:40:49,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:49,316 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 18 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:49,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 277 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-08 20:40:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2024-11-08 20:40:49,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:40:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2024-11-08 20:40:49,332 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 223 [2024-11-08 20:40:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:49,334 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2024-11-08 20:40:49,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:49,335 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2024-11-08 20:40:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 20:40:49,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:49,340 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:49,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:40:49,341 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:49,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -399224493, now seen corresponding path program 1 times [2024-11-08 20:40:49,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:49,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200974987] [2024-11-08 20:40:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:40:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:40:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:40:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 20:40:49,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:40:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:40:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:40:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:40:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:40:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:40:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:40:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:40:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:40:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:40:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:40:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:40:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:40:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:40:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:40:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:40:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:40:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:40:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:40:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:40:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:40:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200974987] [2024-11-08 20:40:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200974987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:40:49,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375572327] [2024-11-08 20:40:49,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:49,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:40:49,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:49,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:40:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:49,687 INFO L87 Difference]: Start difference. First operand 100 states and 154 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:49,733 INFO L93 Difference]: Finished difference Result 294 states and 456 transitions. [2024-11-08 20:40:49,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:40:49,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-11-08 20:40:49,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:49,739 INFO L225 Difference]: With dead ends: 294 [2024-11-08 20:40:49,741 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 20:40:49,741 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-11-08 20:40:49,742 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 67 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:49,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 276 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 20:40:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-08 20:40:49,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 120 states have (on average 1.3166666666666667) internal successors, (158), 120 states have internal predecessors, (158), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-08 20:40:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-11-08 20:40:49,785 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 223 [2024-11-08 20:40:49,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:49,786 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-11-08 20:40:49,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:49,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-11-08 20:40:49,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 20:40:49,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:49,790 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:49,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:40:49,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:49,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 564291533, now seen corresponding path program 1 times [2024-11-08 20:40:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189075996] [2024-11-08 20:40:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:49,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:40:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:40:50,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:40:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 20:40:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:40:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:40:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:40:50,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:40:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:40:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:40:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:40:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:40:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:40:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:40:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:40:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:40:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:40:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:40:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:40:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:40:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:40:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:40:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:40:50,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:40:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:40:50,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:50,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189075996] [2024-11-08 20:40:50,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189075996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:50,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:50,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:40:50,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711623203] [2024-11-08 20:40:50,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:50,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:40:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:40:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:40:50,327 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:51,004 INFO L93 Difference]: Finished difference Result 977 states and 1501 transitions. [2024-11-08 20:40:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:40:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-08 20:40:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:51,010 INFO L225 Difference]: With dead ends: 977 [2024-11-08 20:40:51,010 INFO L226 Difference]: Without dead ends: 785 [2024-11-08 20:40:51,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:40:51,011 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 404 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:51,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 577 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:40:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-11-08 20:40:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 649. [2024-11-08 20:40:51,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 416 states have (on average 1.3317307692307692) internal successors, (554), 420 states have internal predecessors, (554), 224 states have call successors, (224), 8 states have call predecessors, (224), 8 states have return successors, (224), 220 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 20:40:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1002 transitions. [2024-11-08 20:40:51,114 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1002 transitions. Word has length 224 [2024-11-08 20:40:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:51,116 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 1002 transitions. [2024-11-08 20:40:51,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1002 transitions. [2024-11-08 20:40:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 20:40:51,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:51,118 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:51,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:40:51,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash -446825717, now seen corresponding path program 1 times [2024-11-08 20:40:51,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:51,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649224066] [2024-11-08 20:40:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:40:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:40:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:40:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 20:40:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 20:40:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 20:40:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 20:40:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 20:40:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-08 20:40:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 20:40:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 20:40:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 20:40:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 20:40:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 20:40:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 20:40:51,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 20:40:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 20:40:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 20:40:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 20:40:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 20:40:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 20:40:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 20:40:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 20:40:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 20:40:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 20:40:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 20:40:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 20:40:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 20:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 20:40:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 20:40:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 20:40:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 20:40:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 20:40:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:40:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:40:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:40:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:40:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:40:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:40:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649224066] [2024-11-08 20:40:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649224066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:40:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:40:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:40:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461894508] [2024-11-08 20:40:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:40:51,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:40:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:40:51,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:40:51,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:51,337 INFO L87 Difference]: Start difference. First operand 649 states and 1002 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:51,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:40:51,393 INFO L93 Difference]: Finished difference Result 1205 states and 1855 transitions. [2024-11-08 20:40:51,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:40:51,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 224 [2024-11-08 20:40:51,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:40:51,399 INFO L225 Difference]: With dead ends: 1205 [2024-11-08 20:40:51,399 INFO L226 Difference]: Without dead ends: 559 [2024-11-08 20:40:51,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:40:51,402 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 99 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:40:51,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 286 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:40:51,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-11-08 20:40:51,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 334. [2024-11-08 20:40:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 199 states have (on average 1.2613065326633166) internal successors, (251), 200 states have internal predecessors, (251), 128 states have call successors, (128), 6 states have call predecessors, (128), 6 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-08 20:40:51,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 507 transitions. [2024-11-08 20:40:51,474 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 507 transitions. Word has length 224 [2024-11-08 20:40:51,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:40:51,475 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 507 transitions. [2024-11-08 20:40:51,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:40:51,475 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 507 transitions. [2024-11-08 20:40:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 20:40:51,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:40:51,476 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:40:51,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:40:51,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:40:51,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:40:51,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1124652209, now seen corresponding path program 1 times [2024-11-08 20:40:51,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:40:51,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944214489] [2024-11-08 20:40:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:40:51,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:40:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:40:51,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 20:40:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 20:40:51,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 20:40:51,693 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 20:40:51,694 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 20:40:51,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:40:51,698 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 20:40:51,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 20:40:51,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 08:40:51 BoogieIcfgContainer [2024-11-08 20:40:51,789 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 20:40:51,790 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 20:40:51,790 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 20:40:51,790 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 20:40:51,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:40:48" (3/4) ... [2024-11-08 20:40:51,792 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 20:40:51,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 20:40:51,794 INFO L158 Benchmark]: Toolchain (without parser) took 4603.65ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 104.7MB in the beginning and 126.3MB in the end (delta: -21.6MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,794 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:40:51,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.33ms. Allocated memory is still 176.2MB. Free memory was 104.6MB in the beginning and 139.5MB in the end (delta: -34.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.12ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,794 INFO L158 Benchmark]: Boogie Preprocessor took 40.03ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 129.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,795 INFO L158 Benchmark]: RCFGBuilder took 498.69ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 102.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,795 INFO L158 Benchmark]: TraceAbstraction took 3624.88ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 102.1MB in the beginning and 126.3MB in the end (delta: -24.3MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-08 20:40:51,795 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 268.4MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:40:51,796 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.15ms. Allocated memory is still 176.2MB. Free memory is still 134.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.33ms. Allocated memory is still 176.2MB. Free memory was 104.6MB in the beginning and 139.5MB in the end (delta: -34.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.12ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 135.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.03ms. Allocated memory is still 176.2MB. Free memory was 135.3MB in the beginning and 129.3MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 498.69ms. Allocated memory is still 176.2MB. Free memory was 129.3MB in the beginning and 102.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3624.88ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 102.1MB in the beginning and 126.3MB in the end (delta: -24.3MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 268.4MB. Free memory is still 126.3MB. 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 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned short int var_1_20 = 8; [L41] unsigned short int var_1_21 = 10; [L42] signed long int var_1_22 = -256; [L43] signed long int var_1_23 = -128; [L44] signed short int var_1_24 = 4; [L45] signed short int var_1_25 = 64; [L46] unsigned long int var_1_26 = 16; [L47] unsigned char var_1_27 = 8; [L48] unsigned char var_1_28 = 0; [L49] unsigned char var_1_29 = 0; [L50] unsigned char var_1_30 = 0; [L51] signed char var_1_31 = -4; [L52] signed char var_1_32 = 2; [L53] signed char var_1_33 = 32; [L54] unsigned char last_1_var_1_8 = 5; [L55] unsigned short int last_1_var_1_18 = 64; VAL [isInitial=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=1, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L199] isInitial = 1 [L200] FCALL initially() [L201] COND TRUE 1 [L202] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=1, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L202] RET updateLastVariables() [L203] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L134] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L135] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L135] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L136] var_1_3 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L137] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L138] var_1_4 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L139] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L140] var_1_5 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L141] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L142] var_1_6 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L143] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] var_1_7 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L145] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_8=5, var_1_9=307/20] [L146] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L146] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5, var_1_9=307/20] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L150] var_1_10 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L151] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L152] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L152] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L153] var_1_11 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L154] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L155] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L155] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L156] var_1_15 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L157] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L158] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L158] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L159] var_1_16 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L160] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L161] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L161] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L162] var_1_17 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L163] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L164] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L164] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=10, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L165] var_1_21 = __VERIFIER_nondet_ushort() [L166] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L166] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L167] CALL assume_abort_if_not(var_1_21 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L167] RET assume_abort_if_not(var_1_21 <= 65534) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=-128, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L168] var_1_23 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L169] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L170] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L170] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=64, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L171] var_1_25 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_25 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L172] RET assume_abort_if_not(var_1_25 >= -32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L173] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L173] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L174] var_1_28 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L175] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L176] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L176] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L177] var_1_29 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L178] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L179] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L179] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L180] var_1_30 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L181] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L182] CALL assume_abort_if_not(var_1_30 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L182] RET assume_abort_if_not(var_1_30 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=2, var_1_33=32, var_1_7=0, var_1_8=5] [L183] var_1_32 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L184] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L185] CALL assume_abort_if_not(var_1_32 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L185] RET assume_abort_if_not(var_1_32 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=32, var_1_7=0, var_1_8=5] [L186] var_1_33 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L187] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L188] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L188] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=8, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L203] RET updateVariables() [L204] CALL step() [L59] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L60] COND FALSE !(var_1_20 < var_1_21) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=4, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L63] COND TRUE (~ var_1_20) != ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23))) [L64] var_1_24 = var_1_25 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=16, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L66] var_1_26 = var_1_20 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L67] EXPR var_1_25 | ((((-16) > (var_1_20)) ? (-16) : (var_1_20))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-4, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L67] COND FALSE !(var_1_23 > (var_1_25 | ((((-16) > (var_1_20)) ? (-16) : (var_1_20))))) [L74] COND TRUE var_1_27 >= var_1_21 [L75] var_1_31 = (var_1_32 - var_1_33) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L79] COND FALSE !(\read(var_1_2)) [L86] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L88] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=5] [L89] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L90] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L98] COND FALSE !(\read(var_1_2)) [L107] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L109] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=64, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L110] COND TRUE var_1_10 == stepLocal_1 [L111] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L115] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L118] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L121] COND FALSE !(last_1_var_1_18 != var_1_16) [L128] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L204] RET step() [L205] CALL, EXPR property() [L195-L196] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; VAL [\result=0, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L205] RET, EXPR property() [L205] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=64, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=128, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=-256, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=8, var_1_28=0, var_1_29=1, var_1_2=0, var_1_30=0, var_1_31=-1, var_1_32=125, var_1_33=126, var_1_7=0, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 588 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 588 mSDsluCounter, 1560 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 518 IncrementalHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 808 mSDtfsCounter, 518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 417 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=649occurred in iteration=4, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 374 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1921 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 12600/12600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 20:40:51,823 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.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 a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:40:53,880 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:40:53,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:40:53,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:40:53,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:40:53,999 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:40:54,001 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:40:54,001 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:40:54,002 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:40:54,004 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:40:54,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:40:54,005 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:40:54,005 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:40:54,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:40:54,007 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:40:54,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:40:54,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:40:54,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:40:54,008 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:40:54,008 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:40:54,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:40:54,009 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:40:54,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:40:54,009 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:40:54,010 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:40:54,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:40:54,010 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:40:54,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:40:54,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:40:54,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:40:54,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:40:54,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:40:54,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:40:54,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:40:54,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:54,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:40:54,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:40:54,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:40:54,014 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:40:54,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:40:54,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:40:54,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:40:54,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:40:54,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:40:54,015 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 -> a104afcb2f372aeba0c899855b97d8600d44f06bd857022208f4356fb9ab9902 [2024-11-08 20:40:54,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:40:54,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:40:54,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:40:54,344 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:40:54,344 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:40:54,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:40:55,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:40:56,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:40:56,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:40:56,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afee33c82/1284dd480c3e45b8be52e052f4b8c899/FLAGa5e39a6af [2024-11-08 20:40:56,084 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afee33c82/1284dd480c3e45b8be52e052f4b8c899 [2024-11-08 20:40:56,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:40:56,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:40:56,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:56,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:40:56,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:40:56,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a8c6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56, skipping insertion in model container [2024-11-08 20:40:56,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:40:56,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-08 20:40:56,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:56,332 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:40:56,342 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-48.i[915,928] [2024-11-08 20:40:56,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:40:56,387 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:40:56,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56 WrapperNode [2024-11-08 20:40:56,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:40:56,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:56,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:40:56,389 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:40:56,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,426 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-08 20:40:56,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:40:56,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:40:56,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:40:56,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:40:56,438 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,455 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:40:56,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:40:56,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:40:56,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:40:56,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:40:56,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (1/1) ... [2024-11-08 20:40:56,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:40:56,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:40:56,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:40:56,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:40:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:40:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:40:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:40:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:40:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:40:56,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:40:56,680 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:40:56,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:41:14,098 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 20:41:14,099 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:41:14,108 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:41:14,108 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:41:14,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:14 BoogieIcfgContainer [2024-11-08 20:41:14,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:41:14,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:41:14,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:41:14,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:41:14,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:40:56" (1/3) ... [2024-11-08 20:41:14,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db03d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:14, skipping insertion in model container [2024-11-08 20:41:14,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:40:56" (2/3) ... [2024-11-08 20:41:14,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@db03d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:41:14, skipping insertion in model container [2024-11-08 20:41:14,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:41:14" (3/3) ... [2024-11-08 20:41:14,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-48.i [2024-11-08 20:41:14,129 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:41:14,130 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:41:14,185 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:41:14,192 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;@45297b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:41:14,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:41:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:41:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 20:41:14,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:14,210 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:41:14,210 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:14,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash 377422195, now seen corresponding path program 1 times [2024-11-08 20:41:14,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:14,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66803244] [2024-11-08 20:41:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:14,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:14,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:14,249 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:41:14,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:41:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:15,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:41:15,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 566 proven. 0 refuted. 0 times theorem prover too weak. 1954 trivial. 0 not checked. [2024-11-08 20:41:15,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:15,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66803244] [2024-11-08 20:41:15,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66803244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:15,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:15,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:41:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147269252] [2024-11-08 20:41:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:41:15,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:15,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:41:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:41:15,931 INFO L87 Difference]: Start difference. First operand has 95 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 20:41:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:15,967 INFO L93 Difference]: Finished difference Result 182 states and 328 transitions. [2024-11-08 20:41:15,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:41:15,970 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2024-11-08 20:41:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:15,978 INFO L225 Difference]: With dead ends: 182 [2024-11-08 20:41:15,978 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 20:41:15,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:41:15,986 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:15,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:41:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 20:41:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 20:41:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 20:41:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-11-08 20:41:16,039 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 222 [2024-11-08 20:41:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-11-08 20:41:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-08 20:41:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-11-08 20:41:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 20:41:16,045 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:16,046 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:41:16,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:41:16,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:16,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:16,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:16,249 INFO L85 PathProgramCache]: Analyzing trace with hash 741888875, now seen corresponding path program 1 times [2024-11-08 20:41:16,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:16,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142252459] [2024-11-08 20:41:16,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:16,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:16,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:41:16,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:41:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:17,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:41:17,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:41:18,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:18,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:18,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142252459] [2024-11-08 20:41:18,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142252459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:18,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:18,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:18,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523332629] [2024-11-08 20:41:18,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:18,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:18,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:18,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:18,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:18,104 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:18,412 INFO L93 Difference]: Finished difference Result 215 states and 332 transitions. [2024-11-08 20:41:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:18,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-11-08 20:41:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:18,418 INFO L225 Difference]: With dead ends: 215 [2024-11-08 20:41:18,418 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 20:41:18,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:18,422 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 94 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:18,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 283 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:41:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 20:41:18,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-08 20:41:18,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 69 states have internal predecessors, (82), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:41:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2024-11-08 20:41:18,438 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 222 [2024-11-08 20:41:18,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:18,439 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2024-11-08 20:41:18,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2024-11-08 20:41:18,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 20:41:18,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:18,441 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:41:18,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:41:18,642 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-11-08 20:41:18,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -846459027, now seen corresponding path program 1 times [2024-11-08 20:41:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073323670] [2024-11-08 20:41:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:18,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:18,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:18,648 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-11-08 20:41:18,649 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-11-08 20:41:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:20,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:41:20,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:41:20,344 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:20,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073323670] [2024-11-08 20:41:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073323670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:41:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121940400] [2024-11-08 20:41:20,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:20,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:20,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:20,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:20,347 INFO L87 Difference]: Start difference. First operand 127 states and 194 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:24,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:29,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:29,687 INFO L93 Difference]: Finished difference Result 236 states and 358 transitions. [2024-11-08 20:41:29,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:29,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-11-08 20:41:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:29,695 INFO L225 Difference]: With dead ends: 236 [2024-11-08 20:41:29,695 INFO L226 Difference]: Without dead ends: 145 [2024-11-08 20:41:29,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:29,696 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 20 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:29,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 265 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 9.3s Time] [2024-11-08 20:41:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-08 20:41:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 134. [2024-11-08 20:41:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 76 states have internal predecessors, (92), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 20:41:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 204 transitions. [2024-11-08 20:41:29,712 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 204 transitions. Word has length 222 [2024-11-08 20:41:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:29,712 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 204 transitions. [2024-11-08 20:41:29,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 204 transitions. [2024-11-08 20:41:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 20:41:29,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:29,729 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:41:29,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 20:41:29,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:29,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:29,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:29,934 INFO L85 PathProgramCache]: Analyzing trace with hash -789200725, now seen corresponding path program 1 times [2024-11-08 20:41:29,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:29,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932725623] [2024-11-08 20:41:29,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:29,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:29,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:29,937 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:41:29,942 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 (5)] Waiting until timeout for monitored process [2024-11-08 20:41:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:31,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:41:31,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:41:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 20:41:39,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:41:39,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:41:39,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932725623] [2024-11-08 20:41:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932725623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:41:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:41:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:41:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677536249] [2024-11-08 20:41:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:41:39,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:41:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:41:39,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:41:39,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:39,848 INFO L87 Difference]: Start difference. First operand 134 states and 204 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:44,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:49,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 20:41:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:41:49,258 INFO L93 Difference]: Finished difference Result 330 states and 500 transitions. [2024-11-08 20:41:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:41:49,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-11-08 20:41:49,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:41:49,261 INFO L225 Difference]: With dead ends: 330 [2024-11-08 20:41:49,261 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 20:41:49,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:41:49,263 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 23 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:41:49,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 265 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 20:41:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 20:41:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2024-11-08 20:41:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 133 states have (on average 1.2406015037593985) internal successors, (165), 134 states have internal predecessors, (165), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-08 20:41:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 349 transitions. [2024-11-08 20:41:49,302 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 349 transitions. Word has length 222 [2024-11-08 20:41:49,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:41:49,303 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 349 transitions. [2024-11-08 20:41:49,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-08 20:41:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 349 transitions. [2024-11-08 20:41:49,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 20:41:49,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:41:49,305 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:41:49,344 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 (5)] Ended with exit code 0 [2024-11-08 20:41:49,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:49,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:41:49,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:41:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1359930217, now seen corresponding path program 1 times [2024-11-08 20:41:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:41:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681540151] [2024-11-08 20:41:49,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:41:49,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:41:49,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:41:49,518 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:41:49,521 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 (6)] Waiting until timeout for monitored process [2024-11-08 20:41:50,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:41:50,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 20:41:51,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:42:08,809 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 20:42:16,961 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 20:42:25,489 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)