./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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_fillercodestructure_filler-ps-co_file-35.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 ca3c01919c43e0ce3003533aeb3aa2c1c334fcdafab5e1dcbea8bbdbaedc6205 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:19:44,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:19:44,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 06:19:44,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:19:44,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:19:44,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:19:44,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:19:44,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:19:44,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:19:44,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:19:44,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:19:44,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:19:44,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:19:44,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:19:44,326 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:19:44,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:19:44,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:19:44,327 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:19:44,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 06:19:44,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:19:44,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:19:44,328 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:19:44,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:19:44,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:19:44,329 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:19:44,330 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:19:44,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:19:44,330 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:19:44,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:19:44,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:19:44,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:19:44,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:19:44,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:19:44,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:19:44,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:19:44,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:19:44,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 06:19:44,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 06:19:44,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:19:44,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:19:44,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:19:44,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:19:44,335 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 -> ca3c01919c43e0ce3003533aeb3aa2c1c334fcdafab5e1dcbea8bbdbaedc6205 [2024-11-10 06:19:44,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:19:44,713 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:19:44,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:19:44,718 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:19:44,719 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:19:44,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:19:46,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:19:46,499 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:19:46,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:19:46,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4934f7d92/b14b349320844cdbb9b690d6861ebf47/FLAGfbda9a6c5 [2024-11-10 06:19:46,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4934f7d92/b14b349320844cdbb9b690d6861ebf47 [2024-11-10 06:19:46,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:19:46,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:19:46,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:19:46,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:19:46,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:19:46,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:46,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a3b160e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46, skipping insertion in model container [2024-11-10 06:19:46,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:46,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:19:46,787 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_fillercodestructure_filler-ps-co_file-35.i[919,932] [2024-11-10 06:19:46,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:19:46,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:19:46,895 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_fillercodestructure_filler-ps-co_file-35.i[919,932] [2024-11-10 06:19:46,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:19:46,984 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:19:46,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46 WrapperNode [2024-11-10 06:19:46,984 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:19:46,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:19:46,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:19:46,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:19:46,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,060 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 259 [2024-11-10 06:19:47,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:19:47,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:19:47,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:19:47,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:19:47,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,113 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-10 06:19:47,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:19:47,169 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:19:47,169 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:19:47,170 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:19:47,171 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (1/1) ... [2024-11-10 06:19:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:19:47,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:19:47,208 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-10 06:19:47,210 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-10 06:19:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:19:47,257 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:19:47,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:19:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 06:19:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:19:47,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:19:47,358 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:19:47,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:19:47,969 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc property_#t~bitwise27#1;havoc property_#t~short28#1; [2024-11-10 06:19:48,030 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 06:19:48,030 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:19:48,064 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:19:48,065 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:19:48,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:19:48 BoogieIcfgContainer [2024-11-10 06:19:48,066 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:19:48,069 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:19:48,069 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:19:48,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:19:48,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:19:46" (1/3) ... [2024-11-10 06:19:48,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0b5b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:19:48, skipping insertion in model container [2024-11-10 06:19:48,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:19:46" (2/3) ... [2024-11-10 06:19:48,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0b5b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:19:48, skipping insertion in model container [2024-11-10 06:19:48,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:19:48" (3/3) ... [2024-11-10 06:19:48,077 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:19:48,095 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:19:48,096 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:19:48,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:19:48,170 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;@40f18b3b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:19:48,170 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:19:48,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:19:48,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 06:19:48,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:48,190 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:48,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:48,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash 616410966, now seen corresponding path program 1 times [2024-11-10 06:19:48,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:48,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934429739] [2024-11-10 06:19:48,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:48,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:48,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934429739] [2024-11-10 06:19:48,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934429739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:48,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:48,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:19:48,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344751858] [2024-11-10 06:19:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:48,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:19:48,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:48,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:19:48,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:19:48,895 INFO L87 Difference]: Start difference. First operand has 110 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:19:48,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:48,959 INFO L93 Difference]: Finished difference Result 211 states and 359 transitions. [2024-11-10 06:19:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:19:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 213 [2024-11-10 06:19:48,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:48,974 INFO L225 Difference]: With dead ends: 211 [2024-11-10 06:19:48,975 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 06:19:48,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-10 06:19:48,988 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:48,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:19:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 06:19:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 06:19:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:19:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2024-11-10 06:19:49,063 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 213 [2024-11-10 06:19:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:49,064 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2024-11-10 06:19:49,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:19:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2024-11-10 06:19:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-10 06:19:49,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:49,074 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:49,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 06:19:49,075 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:49,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2117228005, now seen corresponding path program 1 times [2024-11-10 06:19:49,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:49,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665772639] [2024-11-10 06:19:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:49,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:49,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:49,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:50,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:50,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665772639] [2024-11-10 06:19:50,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665772639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:50,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:50,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:19:50,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733205474] [2024-11-10 06:19:50,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:50,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:19:50,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:19:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:19:50,053 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:50,473 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2024-11-10 06:19:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:19:50,476 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-10 06:19:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:50,482 INFO L225 Difference]: With dead ends: 328 [2024-11-10 06:19:50,482 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 06:19:50,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:19:50,488 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 146 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:50,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 552 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 06:19:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 06:19:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 202. [2024-11-10 06:19:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 135 states have internal predecessors, (180), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:19:50,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 308 transitions. [2024-11-10 06:19:50,535 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 308 transitions. Word has length 213 [2024-11-10 06:19:50,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 308 transitions. [2024-11-10 06:19:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 308 transitions. [2024-11-10 06:19:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-10 06:19:50,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:50,540 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 06:19:50,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:50,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1240009406, now seen corresponding path program 1 times [2024-11-10 06:19:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023194007] [2024-11-10 06:19:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:50,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:51,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:51,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023194007] [2024-11-10 06:19:51,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023194007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:51,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:51,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:19:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016333584] [2024-11-10 06:19:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:19:51,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:51,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:19:51,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:19:51,196 INFO L87 Difference]: Start difference. First operand 202 states and 308 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:51,284 INFO L93 Difference]: Finished difference Result 600 states and 918 transitions. [2024-11-10 06:19:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:19:51,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-10 06:19:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:51,291 INFO L225 Difference]: With dead ends: 600 [2024-11-10 06:19:51,291 INFO L226 Difference]: Without dead ends: 401 [2024-11-10 06:19:51,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-10 06:19:51,296 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 95 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:51,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 311 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:19:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-10 06:19:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2024-11-10 06:19:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 265 states have (on average 1.3245283018867924) internal successors, (351), 265 states have internal predecessors, (351), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 06:19:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 607 transitions. [2024-11-10 06:19:51,393 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 607 transitions. Word has length 214 [2024-11-10 06:19:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:51,396 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 607 transitions. [2024-11-10 06:19:51,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:51,396 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 607 transitions. [2024-11-10 06:19:51,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 06:19:51,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:51,401 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:51,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 06:19:51,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:51,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1269797431, now seen corresponding path program 1 times [2024-11-10 06:19:51,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:51,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879522844] [2024-11-10 06:19:51,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:51,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:51,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:51,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:51,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879522844] [2024-11-10 06:19:51,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879522844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:51,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:51,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:19:51,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159949818] [2024-11-10 06:19:51,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:51,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:19:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:51,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:19:51,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:19:51,838 INFO L87 Difference]: Start difference. First operand 398 states and 607 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:52,162 INFO L93 Difference]: Finished difference Result 1321 states and 2001 transitions. [2024-11-10 06:19:52,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 06:19:52,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-10 06:19:52,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:52,173 INFO L225 Difference]: With dead ends: 1321 [2024-11-10 06:19:52,174 INFO L226 Difference]: Without dead ends: 926 [2024-11-10 06:19:52,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:19:52,181 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 191 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:52,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 595 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:19:52,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2024-11-10 06:19:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 884. [2024-11-10 06:19:52,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 587 states have (on average 1.2964224872231687) internal successors, (761), 591 states have internal predecessors, (761), 284 states have call successors, (284), 12 states have call predecessors, (284), 12 states have return successors, (284), 280 states have call predecessors, (284), 284 states have call successors, (284) [2024-11-10 06:19:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1329 transitions. [2024-11-10 06:19:52,329 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1329 transitions. Word has length 215 [2024-11-10 06:19:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:52,330 INFO L471 AbstractCegarLoop]: Abstraction has 884 states and 1329 transitions. [2024-11-10 06:19:52,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1329 transitions. [2024-11-10 06:19:52,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-10 06:19:52,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:52,333 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:52,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 06:19:52,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:52,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:52,334 INFO L85 PathProgramCache]: Analyzing trace with hash 764238806, now seen corresponding path program 1 times [2024-11-10 06:19:52,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:52,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053788047] [2024-11-10 06:19:52,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:52,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:52,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:52,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053788047] [2024-11-10 06:19:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053788047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:52,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:19:52,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328822946] [2024-11-10 06:19:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:52,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:19:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:52,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:19:52,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:19:52,880 INFO L87 Difference]: Start difference. First operand 884 states and 1329 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:53,014 INFO L93 Difference]: Finished difference Result 1841 states and 2772 transitions. [2024-11-10 06:19:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:19:53,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-10 06:19:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:53,025 INFO L225 Difference]: With dead ends: 1841 [2024-11-10 06:19:53,025 INFO L226 Difference]: Without dead ends: 960 [2024-11-10 06:19:53,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-10 06:19:53,030 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 53 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:53,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 268 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:19:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-10 06:19:53,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 954. [2024-11-10 06:19:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 624 states have (on average 1.2868589743589745) internal successors, (803), 628 states have internal predecessors, (803), 316 states have call successors, (316), 13 states have call predecessors, (316), 13 states have return successors, (316), 312 states have call predecessors, (316), 316 states have call successors, (316) [2024-11-10 06:19:53,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1435 transitions. [2024-11-10 06:19:53,154 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1435 transitions. Word has length 215 [2024-11-10 06:19:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:53,155 INFO L471 AbstractCegarLoop]: Abstraction has 954 states and 1435 transitions. [2024-11-10 06:19:53,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1435 transitions. [2024-11-10 06:19:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 06:19:53,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:53,158 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:53,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 06:19:53,158 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:53,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:53,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1384162178, now seen corresponding path program 1 times [2024-11-10 06:19:53,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:53,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969600149] [2024-11-10 06:19:53,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:53,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:53,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:53,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:53,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:53,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969600149] [2024-11-10 06:19:53,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969600149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:53,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:53,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 06:19:53,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341120396] [2024-11-10 06:19:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:53,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:19:53,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:53,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:19:53,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:19:53,649 INFO L87 Difference]: Start difference. First operand 954 states and 1435 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:54,023 INFO L93 Difference]: Finished difference Result 1514 states and 2243 transitions. [2024-11-10 06:19:54,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:19:54,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-10 06:19:54,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:54,032 INFO L225 Difference]: With dead ends: 1514 [2024-11-10 06:19:54,033 INFO L226 Difference]: Without dead ends: 1072 [2024-11-10 06:19:54,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:19:54,037 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 113 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:54,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 574 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 06:19:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-10 06:19:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 882. [2024-11-10 06:19:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 580 states have (on average 1.2948275862068965) internal successors, (751), 580 states have internal predecessors, (751), 288 states have call successors, (288), 13 states have call predecessors, (288), 13 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-10 06:19:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1327 transitions. [2024-11-10 06:19:54,156 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1327 transitions. Word has length 216 [2024-11-10 06:19:54,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:54,157 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1327 transitions. [2024-11-10 06:19:54,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1327 transitions. [2024-11-10 06:19:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-10 06:19:54,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:54,160 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:54,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 06:19:54,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:54,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:54,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1187648673, now seen corresponding path program 1 times [2024-11-10 06:19:54,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:54,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398296713] [2024-11-10 06:19:54,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:54,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:54,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:19:54,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:54,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398296713] [2024-11-10 06:19:54,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398296713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:19:54,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:19:54,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:19:54,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571475152] [2024-11-10 06:19:54,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:19:54,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:19:54,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:54,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:19:54,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:19:54,562 INFO L87 Difference]: Start difference. First operand 882 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:54,699 INFO L93 Difference]: Finished difference Result 1727 states and 2599 transitions. [2024-11-10 06:19:54,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:19:54,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 216 [2024-11-10 06:19:54,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:54,708 INFO L225 Difference]: With dead ends: 1727 [2024-11-10 06:19:54,708 INFO L226 Difference]: Without dead ends: 918 [2024-11-10 06:19:54,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-10 06:19:54,713 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 88 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:54,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 266 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 06:19:54,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-11-10 06:19:54,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 882. [2024-11-10 06:19:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 580 states have (on average 1.2948275862068965) internal successors, (751), 580 states have internal predecessors, (751), 288 states have call successors, (288), 13 states have call predecessors, (288), 13 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-10 06:19:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1327 transitions. [2024-11-10 06:19:54,807 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1327 transitions. Word has length 216 [2024-11-10 06:19:54,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:54,808 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1327 transitions. [2024-11-10 06:19:54,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:19:54,809 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1327 transitions. [2024-11-10 06:19:54,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 06:19:54,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:54,811 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:54,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 06:19:54,812 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:54,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:54,812 INFO L85 PathProgramCache]: Analyzing trace with hash -586492906, now seen corresponding path program 1 times [2024-11-10 06:19:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:54,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351317657] [2024-11-10 06:19:54,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:54,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 06:19:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 06:19:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 06:19:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 06:19:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 06:19:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 06:19:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 06:19:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 06:19:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 06:19:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 06:19:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 06:19:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 06:19:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 06:19:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 06:19:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 06:19:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 06:19:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-10 06:19:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-10 06:19:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-10 06:19:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-10 06:19:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-10 06:19:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-10 06:19:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-10 06:19:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-10 06:19:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-10 06:19:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-10 06:19:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-10 06:19:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-10 06:19:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-10 06:19:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-10 06:19:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-10 06:19:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-10 06:19:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-10 06:19:55,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 06:19:55,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351317657] [2024-11-10 06:19:55,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351317657] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 06:19:55,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105211861] [2024-11-10 06:19:55,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:55,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:19:55,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:19:55,367 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:19:55,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 06:19:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:19:55,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 06:19:55,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:19:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 728 proven. 15 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2024-11-10 06:19:56,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 06:19:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 78 proven. 15 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-10 06:19:57,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105211861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 06:19:57,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 06:19:57,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2024-11-10 06:19:57,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951283479] [2024-11-10 06:19:57,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 06:19:57,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 06:19:57,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 06:19:57,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 06:19:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-10 06:19:57,441 INFO L87 Difference]: Start difference. First operand 882 states and 1327 transitions. Second operand has 16 states, 14 states have (on average 8.5) internal successors, (119), 16 states have internal predecessors, (119), 8 states have call successors, (96), 4 states have call predecessors, (96), 7 states have return successors, (96), 8 states have call predecessors, (96), 8 states have call successors, (96) [2024-11-10 06:19:58,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:19:58,526 INFO L93 Difference]: Finished difference Result 2239 states and 3351 transitions. [2024-11-10 06:19:58,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 06:19:58,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 8.5) internal successors, (119), 16 states have internal predecessors, (119), 8 states have call successors, (96), 4 states have call predecessors, (96), 7 states have return successors, (96), 8 states have call predecessors, (96), 8 states have call successors, (96) Word has length 217 [2024-11-10 06:19:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:19:58,540 INFO L225 Difference]: With dead ends: 2239 [2024-11-10 06:19:58,540 INFO L226 Difference]: Without dead ends: 1423 [2024-11-10 06:19:58,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-10 06:19:58,546 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 240 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 06:19:58,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 524 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 06:19:58,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-11-10 06:19:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 886. [2024-11-10 06:19:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 583 states have (on average 1.2898799313893654) internal successors, (752), 583 states have internal predecessors, (752), 288 states have call successors, (288), 14 states have call predecessors, (288), 14 states have return successors, (288), 288 states have call predecessors, (288), 288 states have call successors, (288) [2024-11-10 06:19:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1328 transitions. [2024-11-10 06:19:58,742 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1328 transitions. Word has length 217 [2024-11-10 06:19:58,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:19:58,742 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1328 transitions. [2024-11-10 06:19:58,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 8.5) internal successors, (119), 16 states have internal predecessors, (119), 8 states have call successors, (96), 4 states have call predecessors, (96), 7 states have return successors, (96), 8 states have call predecessors, (96), 8 states have call successors, (96) [2024-11-10 06:19:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1328 transitions. [2024-11-10 06:19:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-10 06:19:58,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:19:58,747 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:19:58,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 06:19:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:19:58,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:19:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:19:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 375121111, now seen corresponding path program 1 times [2024-11-10 06:19:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 06:19:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549047055] [2024-11-10 06:19:58,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 06:19:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 06:19:59,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [538165994] [2024-11-10 06:19:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:19:59,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 06:19:59,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:19:59,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 06:19:59,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 06:19:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:19:59,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 06:19:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 06:19:59,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 06:19:59,508 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 06:19:59,509 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 06:19:59,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 06:19:59,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-10 06:19:59,716 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 06:19:59,894 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 06:19:59,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:19:59 BoogieIcfgContainer [2024-11-10 06:19:59,901 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 06:19:59,902 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 06:19:59,902 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 06:19:59,902 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 06:19:59,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:19:48" (3/4) ... [2024-11-10 06:19:59,905 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 06:19:59,906 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 06:19:59,907 INFO L158 Benchmark]: Toolchain (without parser) took 13375.33ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 129.6MB in the beginning and 287.4MB in the end (delta: -157.8MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,907 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:19:59,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.97ms. Allocated memory is still 161.5MB. Free memory was 129.6MB in the beginning and 111.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.52ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 107.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,907 INFO L158 Benchmark]: Boogie Preprocessor took 107.09ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,908 INFO L158 Benchmark]: IcfgBuilder took 897.26ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 108.0MB in the end (delta: -4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,908 INFO L158 Benchmark]: TraceAbstraction took 11831.96ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 107.0MB in the beginning and 288.4MB in the end (delta: -181.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 06:19:59,908 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 377.5MB. Free memory was 288.4MB in the beginning and 287.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 06:19:59,909 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.53ms. Allocated memory is still 104.9MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.97ms. Allocated memory is still 161.5MB. Free memory was 129.6MB in the beginning and 111.8MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.52ms. Allocated memory is still 161.5MB. Free memory was 111.8MB in the beginning and 107.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.09ms. Allocated memory is still 161.5MB. Free memory was 107.6MB in the beginning and 103.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 897.26ms. Allocated memory is still 161.5MB. Free memory was 103.4MB in the beginning and 108.0MB in the end (delta: -4.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11831.96ms. Allocated memory was 161.5MB in the beginning and 377.5MB in the end (delta: 216.0MB). Free memory was 107.0MB in the beginning and 288.4MB in the end (delta: -181.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 377.5MB. Free memory was 288.4MB in the beginning and 287.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of bitwiseOr at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someUnaryFLOAToperation at line 128, overapproximation of someBinaryArithmeticFLOAToperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed char var_1_30 = -25; [L47] signed short int var_1_31 = 0; [L48] signed char var_1_33 = 32; [L49] signed char var_1_34 = -4; [L50] unsigned long int var_1_35 = 1; [L51] double var_1_39 = 7.75; [L52] double var_1_40 = 99999.625; [L53] float var_1_41 = 255.2; [L54] unsigned char var_1_42 = 25; [L55] unsigned char var_1_43 = 64; [L56] unsigned char var_1_44 = 1; [L57] float var_1_45 = 255.5; [L58] float var_1_46 = 10.55; [L59] signed short int last_1_var_1_12 = 2; [L60] signed long int last_1_var_1_13 = -256; [L61] double last_1_var_1_14 = 127.75; [L62] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L195] last_1_var_1_12 = var_1_12 [L196] last_1_var_1_13 = var_1_13 [L197] last_1_var_1_14 = var_1_14 [L198] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L208] RET updateLastVariables() [L209] CALL updateVariables() [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L142] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L146] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L146] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L147] var_1_5 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L148] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L149] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L149] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L150] var_1_9 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_9 >= 0.0F && 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not((var_1_9 >= 0.0F && 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_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_11 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L155] var_1_15 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L156] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L157] var_1_17 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L158] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L159] var_1_18 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L160] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L161] var_1_19 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L162] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L163] var_1_20 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L165] var_1_22 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L168] var_1_24 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L169] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L171] var_1_25 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L172] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L174] var_1_27 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L175] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=0, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] var_1_31 = __VERIFIER_nondet_short() [L177] CALL assume_abort_if_not(var_1_31 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L177] RET assume_abort_if_not(var_1_31 >= -32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] CALL assume_abort_if_not(var_1_31 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_31 <= 32767) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] var_1_33 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_33 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L180] RET assume_abort_if_not(var_1_33 >= -126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] var_1_34 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L183] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L184] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L184] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_40=799997/8, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L185] var_1_40 = __VERIFIER_nondet_double() [L186] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L186] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L187] var_1_43 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L188] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L189] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L189] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L190] var_1_44 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L191] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L192] CALL assume_abort_if_not(var_1_44 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L192] RET assume_abort_if_not(var_1_44 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L209] RET updateVariables() [L210] CALL step() [L66] var_1_26 = var_1_27 [L67] var_1_28 = var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=-25, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L68] COND FALSE !(var_1_27 <= var_1_16) [L73] var_1_30 = (50 + var_1_34) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L75] COND TRUE ! var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L76] COND FALSE !((var_1_31 == var_1_23) && var_1_21) [L79] var_1_35 = ((((var_1_6) < (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L82] COND TRUE 32u >= (((((var_1_13) > (var_1_6)) ? (var_1_13) : (var_1_6))) % 16u) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L83] COND FALSE !((-5 > var_1_31) && (var_1_23 <= ((((var_1_34) > (var_1_13)) ? (var_1_34) : (var_1_13))))) [L86] var_1_39 = ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L93] var_1_41 = ((((((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) < (var_1_40)) ? (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27)))) : (var_1_40))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L94] EXPR var_1_23 | var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L94] COND TRUE var_1_33 < (var_1_23 | var_1_6) [L95] var_1_42 = ((((var_1_43) < (var_1_44)) ? (var_1_43) : (var_1_44))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L97] var_1_45 = 2.71f [L98] var_1_46 = var_1_40 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L99] COND FALSE !(\read(last_1_var_1_21)) [L102] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L104] COND TRUE var_1_18 > var_1_9 [L105] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L109] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L110] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L111] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L112] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L119] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L120] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L123] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L123] COND FALSE !((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) [L126] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L128] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L129] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L130] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L133] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L134] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L201-L202] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=25, var_1_30=0, var_1_31=-32767, var_1_33=63, var_1_34=-50, var_1_35=25, var_1_39=3, var_1_3=1, var_1_40=5, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 9, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 981 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 926 mSDsluCounter, 3243 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1914 mSDsCounter, 257 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1194 IncrementalHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 257 mSolverCounterUnsat, 1329 mSDtfsCounter, 1194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1019 GetRequests, 983 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=954occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 839 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 2370 NumberOfCodeBlocks, 2370 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2143 ConstructedInterpolants, 0 QuantifiedInterpolants, 7572 SizeOfPredicates, 3 NumberOfNonLiveVariables, 510 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 19795/19840 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-10 06:19:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercodestructure_filler-ps-co_file-35.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 ca3c01919c43e0ce3003533aeb3aa2c1c334fcdafab5e1dcbea8bbdbaedc6205 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 06:20:02,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 06:20:02,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 06:20:02,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 06:20:02,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 06:20:02,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 06:20:02,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 06:20:02,586 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 06:20:02,587 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 06:20:02,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 06:20:02,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 06:20:02,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 06:20:02,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 06:20:02,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 06:20:02,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 06:20:02,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 06:20:02,592 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 06:20:02,592 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 06:20:02,592 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 06:20:02,592 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 06:20:02,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 06:20:02,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 06:20:02,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 06:20:02,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 06:20:02,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 06:20:02,600 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 06:20:02,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 06:20:02,601 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 06:20:02,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 06:20:02,602 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 06:20:02,603 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 06:20:02,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 06:20:02,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 06:20:02,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 06:20:02,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:02,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 06:20:02,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 06:20:02,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 06:20:02,606 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 06:20:02,606 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 06:20:02,607 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 06:20:02,607 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 06:20:02,607 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 06:20:02,607 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 06:20:02,608 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 -> ca3c01919c43e0ce3003533aeb3aa2c1c334fcdafab5e1dcbea8bbdbaedc6205 [2024-11-10 06:20:02,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 06:20:03,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 06:20:03,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 06:20:03,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 06:20:03,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 06:20:03,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:20:04,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 06:20:04,910 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 06:20:04,911 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:20:04,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3feee80b/e119badc288047b9ba2ed4547b50dfc2/FLAG95f310898 [2024-11-10 06:20:04,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3feee80b/e119badc288047b9ba2ed4547b50dfc2 [2024-11-10 06:20:04,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 06:20:04,939 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 06:20:04,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:04,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 06:20:04,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 06:20:04,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:04" (1/1) ... [2024-11-10 06:20:04,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cad7f37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:04, skipping insertion in model container [2024-11-10 06:20:04,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:20:04" (1/1) ... [2024-11-10 06:20:04,984 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 06:20:05,208 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_fillercodestructure_filler-ps-co_file-35.i[919,932] [2024-11-10 06:20:05,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:05,343 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 06:20:05,358 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_fillercodestructure_filler-ps-co_file-35.i[919,932] [2024-11-10 06:20:05,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 06:20:05,454 INFO L204 MainTranslator]: Completed translation [2024-11-10 06:20:05,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05 WrapperNode [2024-11-10 06:20:05,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 06:20:05,457 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:05,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 06:20:05,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 06:20:05,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,530 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-11-10 06:20:05,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 06:20:05,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 06:20:05,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 06:20:05,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 06:20:05,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,585 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-10 06:20:05,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 06:20:05,630 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 06:20:05,630 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 06:20:05,630 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 06:20:05,631 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (1/1) ... [2024-11-10 06:20:05,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 06:20:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 06:20:05,672 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-10 06:20:05,676 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-10 06:20:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 06:20:05,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 06:20:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 06:20:05,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 06:20:05,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 06:20:05,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 06:20:05,849 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 06:20:05,853 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 06:20:09,160 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 06:20:09,161 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 06:20:09,178 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 06:20:09,179 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 06:20:09,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:20:09 BoogieIcfgContainer [2024-11-10 06:20:09,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 06:20:09,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 06:20:09,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 06:20:09,190 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 06:20:09,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:20:04" (1/3) ... [2024-11-10 06:20:09,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34981c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:20:09, skipping insertion in model container [2024-11-10 06:20:09,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:20:05" (2/3) ... [2024-11-10 06:20:09,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34981c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:20:09, skipping insertion in model container [2024-11-10 06:20:09,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:20:09" (3/3) ... [2024-11-10 06:20:09,196 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-35.i [2024-11-10 06:20:09,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 06:20:09,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 06:20:09,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 06:20:09,307 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;@455288c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 06:20:09,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 06:20:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:20:09,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 06:20:09,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:09,332 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:09,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:09,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:09,337 INFO L85 PathProgramCache]: Analyzing trace with hash 148505258, now seen corresponding path program 1 times [2024-11-10 06:20:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830537192] [2024-11-10 06:20:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:09,355 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-10 06:20:09,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:09,362 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-10 06:20:09,379 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-10 06:20:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:09,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 06:20:09,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 942 proven. 0 refuted. 0 times theorem prover too weak. 1042 trivial. 0 not checked. [2024-11-10 06:20:10,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:20:10,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:20:10,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830537192] [2024-11-10 06:20:10,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830537192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:10,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:10,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:20:10,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163807818] [2024-11-10 06:20:10,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:10,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 06:20:10,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:20:10,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 06:20:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 06:20:10,097 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 63 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:20:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:10,128 INFO L93 Difference]: Finished difference Result 185 states and 319 transitions. [2024-11-10 06:20:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 06:20:10,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-10 06:20:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:10,144 INFO L225 Difference]: With dead ends: 185 [2024-11-10 06:20:10,144 INFO L226 Difference]: Without dead ends: 91 [2024-11-10 06:20:10,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 208 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-10 06:20:10,157 INFO L432 NwaCegarLoop]: 137 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, 137 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-10 06:20:10,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 06:20:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-10 06:20:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-10 06:20:10,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 06:20:10,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 137 transitions. [2024-11-10 06:20:10,225 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 137 transitions. Word has length 209 [2024-11-10 06:20:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:10,226 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 137 transitions. [2024-11-10 06:20:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-10 06:20:10,226 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 137 transitions. [2024-11-10 06:20:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-10 06:20:10,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:10,231 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:10,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 06:20:10,432 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-10 06:20:10,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:10,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:10,434 INFO L85 PathProgramCache]: Analyzing trace with hash -745223634, now seen corresponding path program 1 times [2024-11-10 06:20:10,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:10,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514756186] [2024-11-10 06:20:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:10,436 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-10 06:20:10,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:10,440 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-10 06:20:10,442 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-10 06:20:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:11,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 06:20:11,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:20:11,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:20:11,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:20:11,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514756186] [2024-11-10 06:20:11,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514756186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:11,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 06:20:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934387458] [2024-11-10 06:20:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:11,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 06:20:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:20:11,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 06:20:11,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 06:20:11,801 INFO L87 Difference]: Start difference. First operand 91 states and 137 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:13,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:13,367 INFO L93 Difference]: Finished difference Result 266 states and 403 transitions. [2024-11-10 06:20:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 06:20:13,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 209 [2024-11-10 06:20:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:13,373 INFO L225 Difference]: With dead ends: 266 [2024-11-10 06:20:13,373 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 06:20:13,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 207 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-10 06:20:13,384 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 40 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:13,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 271 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 06:20:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 06:20:13,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2024-11-10 06:20:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 108 states have internal predecessors, (137), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:20:13,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 265 transitions. [2024-11-10 06:20:13,449 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 265 transitions. Word has length 209 [2024-11-10 06:20:13,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:13,450 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 265 transitions. [2024-11-10 06:20:13,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 2 states have internal predecessors, (52), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 265 transitions. [2024-11-10 06:20:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 06:20:13,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:13,458 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:13,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 06:20:13,658 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-10 06:20:13,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:13,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:13,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1449209192, now seen corresponding path program 1 times [2024-11-10 06:20:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:13,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321680681] [2024-11-10 06:20:13,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:13,662 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-10 06:20:13,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:13,663 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-10 06:20:13,665 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-10 06:20:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:14,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 06:20:14,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:20:14,963 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:20:14,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:20:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321680681] [2024-11-10 06:20:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321680681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:14,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:14,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 06:20:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173135003] [2024-11-10 06:20:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:14,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 06:20:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:20:14,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 06:20:14,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 06:20:14,967 INFO L87 Difference]: Start difference. First operand 175 states and 265 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:16,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:17,428 INFO L93 Difference]: Finished difference Result 399 states and 597 transitions. [2024-11-10 06:20:17,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:20:17,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-11-10 06:20:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:17,453 INFO L225 Difference]: With dead ends: 399 [2024-11-10 06:20:17,453 INFO L226 Difference]: Without dead ends: 227 [2024-11-10 06:20:17,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:20:17,456 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 154 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:17,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 446 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 06:20:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-10 06:20:17,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 182. [2024-11-10 06:20:17,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 115 states have internal predecessors, (146), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-10 06:20:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 274 transitions. [2024-11-10 06:20:17,489 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 274 transitions. Word has length 210 [2024-11-10 06:20:17,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 274 transitions. [2024-11-10 06:20:17,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 274 transitions. [2024-11-10 06:20:17,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-10 06:20:17,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:17,493 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:17,519 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-10 06:20:17,694 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-10 06:20:17,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:17,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:17,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1959743369, now seen corresponding path program 1 times [2024-11-10 06:20:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519135953] [2024-11-10 06:20:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:17,697 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-10 06:20:17,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:17,701 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-10 06:20:17,702 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-10 06:20:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:18,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 06:20:18,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:20:18,793 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:20:18,793 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:20:18,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519135953] [2024-11-10 06:20:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519135953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:18,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:18,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 06:20:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065387965] [2024-11-10 06:20:18,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:18,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 06:20:18,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:20:18,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 06:20:18,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 06:20:18,799 INFO L87 Difference]: Start difference. First operand 182 states and 274 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:21,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:23,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:23,045 INFO L93 Difference]: Finished difference Result 567 states and 852 transitions. [2024-11-10 06:20:23,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 06:20:23,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 210 [2024-11-10 06:20:23,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:23,084 INFO L225 Difference]: With dead ends: 567 [2024-11-10 06:20:23,084 INFO L226 Difference]: Without dead ends: 388 [2024-11-10 06:20:23,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:20:23,086 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 101 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:23,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 471 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-10 06:20:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-10 06:20:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 358. [2024-11-10 06:20:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 225 states have (on average 1.2666666666666666) internal successors, (285), 225 states have internal predecessors, (285), 128 states have call successors, (128), 4 states have call predecessors, (128), 4 states have return successors, (128), 128 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-10 06:20:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 541 transitions. [2024-11-10 06:20:23,162 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 541 transitions. Word has length 210 [2024-11-10 06:20:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 541 transitions. [2024-11-10 06:20:23,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 541 transitions. [2024-11-10 06:20:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:20:23,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:23,170 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:23,200 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-10 06:20:23,371 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-10 06:20:23,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:23,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1526918099, now seen corresponding path program 1 times [2024-11-10 06:20:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483959359] [2024-11-10 06:20:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:23,373 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-10 06:20:23,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:23,377 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-10 06:20:23,384 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-10 06:20:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:23,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 06:20:23,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 06:20:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-10 06:20:24,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 06:20:24,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 06:20:24,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483959359] [2024-11-10 06:20:24,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483959359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 06:20:24,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 06:20:24,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 06:20:24,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204035670] [2024-11-10 06:20:24,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 06:20:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 06:20:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 06:20:24,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 06:20:24,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 06:20:24,055 INFO L87 Difference]: Start difference. First operand 358 states and 541 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:26,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:28,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:29,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 06:20:30,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 06:20:30,768 INFO L93 Difference]: Finished difference Result 951 states and 1430 transitions. [2024-11-10 06:20:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 06:20:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-10 06:20:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 06:20:30,788 INFO L225 Difference]: With dead ends: 951 [2024-11-10 06:20:30,789 INFO L226 Difference]: Without dead ends: 772 [2024-11-10 06:20:30,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 06:20:30,791 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 167 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-10 06:20:30,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 600 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-10 06:20:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2024-11-10 06:20:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 420. [2024-11-10 06:20:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 271 states have (on average 1.2656826568265682) internal successors, (343), 273 states have internal predecessors, (343), 142 states have call successors, (142), 6 states have call predecessors, (142), 6 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-10 06:20:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2024-11-10 06:20:30,899 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 211 [2024-11-10 06:20:30,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 06:20:30,900 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2024-11-10 06:20:30,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-10 06:20:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2024-11-10 06:20:30,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-10 06:20:30,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 06:20:30,904 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:20:30,931 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 (6)] Ended with exit code 0 [2024-11-10 06:20:31,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-10 06:20:31,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 06:20:31,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 06:20:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash 215892236, now seen corresponding path program 1 times [2024-11-10 06:20:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 06:20:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1725097801] [2024-11-10 06:20:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 06:20:31,107 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-10 06:20:31,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 06:20:31,109 INFO L229 MonitoredProcess]: Starting monitored process 7 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-10 06:20:31,111 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 (7)] Waiting until timeout for monitored process [2024-11-10 06:20:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 06:20:31,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 06:20:31,794 INFO L278 TraceCheckSpWp]: Computing forward predicates...