./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:04:44,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:04:44,229 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:04:44,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:04:44,235 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:04:44,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:04:44,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:04:44,259 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:04:44,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:04:44,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:04:44,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:04:44,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:04:44,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:04:44,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:04:44,262 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:04:44,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:04:44,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:04:44,263 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:04:44,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:04:44,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:04:44,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:04:44,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:04:44,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:04:44,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:04:44,265 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:04:44,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:04:44,266 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:04:44,266 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:04:44,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:04:44,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:04:44,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:04:44,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:04:44,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:44,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:04:44,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:04:44,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:04:44,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:04:44,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:04:44,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:04:44,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:04:44,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:04:44,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:04:44,273 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 [2024-10-11 10:04:44,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:04:44,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:04:44,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:04:44,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:04:44,553 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:04:44,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:45,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:04:46,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:04:46,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:46,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d824e981d/7f58e433b381482bbc8cb27f3ee2a028/FLAG8fbf6e561 [2024-10-11 10:04:46,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d824e981d/7f58e433b381482bbc8cb27f3ee2a028 [2024-10-11 10:04:46,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:04:46,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:04:46,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:46,244 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:04:46,250 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:04:46,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40dbb2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46, skipping insertion in model container [2024-10-11 10:04:46,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:04:46,452 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-10-11 10:04:46,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:46,539 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:04:46,554 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-10-11 10:04:46,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:46,650 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:04:46,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46 WrapperNode [2024-10-11 10:04:46,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:46,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:46,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:04:46,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:04:46,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,710 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,752 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-10-11 10:04:46,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:46,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:04:46,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:04:46,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:04:46,765 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,789 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:04:46,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,842 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:04:46,843 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:04:46,843 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:04:46,843 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:04:46,844 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (1/1) ... [2024-10-11 10:04:46,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:46,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:46,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:04:46,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:04:46,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:04:46,915 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:04:46,915 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:04:46,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:04:46,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:04:46,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:04:46,995 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:04:46,997 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:04:47,485 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 10:04:47,485 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:04:47,528 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:04:47,529 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:04:47,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:47 BoogieIcfgContainer [2024-10-11 10:04:47,530 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:04:47,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:04:47,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:04:47,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:04:47,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:04:46" (1/3) ... [2024-10-11 10:04:47,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54532a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:47, skipping insertion in model container [2024-10-11 10:04:47,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:46" (2/3) ... [2024-10-11 10:04:47,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54532a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:47, skipping insertion in model container [2024-10-11 10:04:47,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:47" (3/3) ... [2024-10-11 10:04:47,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:47,557 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:04:47,557 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:04:47,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:04:47,637 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;@4d8bd873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:04:47,640 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:04:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 76 states have (on average 1.5) internal successors, (114), 77 states have internal predecessors, (114), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:04:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 10:04:47,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:47,664 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:47,664 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:47,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:47,669 INFO L85 PathProgramCache]: Analyzing trace with hash -464262508, now seen corresponding path program 1 times [2024-10-11 10:04:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061611803] [2024-10-11 10:04:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:47,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:48,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061611803] [2024-10-11 10:04:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061611803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:48,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:48,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:04:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335004870] [2024-10-11 10:04:48,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:04:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:48,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:04:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:04:48,325 INFO L87 Difference]: Start difference. First operand has 109 states, 76 states have (on average 1.5) internal successors, (114), 77 states have internal predecessors, (114), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:04:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:48,377 INFO L93 Difference]: Finished difference Result 211 states and 370 transitions. [2024-10-11 10:04:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:04:48,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 196 [2024-10-11 10:04:48,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:48,392 INFO L225 Difference]: With dead ends: 211 [2024-10-11 10:04:48,393 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 10:04:48,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:04:48,404 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:48,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:04:48,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 10:04:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 10:04:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 71 states have (on average 1.4225352112676057) internal successors, (101), 71 states have internal predecessors, (101), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:04:48,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 161 transitions. [2024-10-11 10:04:48,470 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 161 transitions. Word has length 196 [2024-10-11 10:04:48,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:48,472 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 161 transitions. [2024-10-11 10:04:48,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:04:48,473 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 161 transitions. [2024-10-11 10:04:48,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-11 10:04:48,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:48,477 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:48,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:04:48,477 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:48,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:48,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1353789568, now seen corresponding path program 1 times [2024-10-11 10:04:48,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:48,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071532890] [2024-10-11 10:04:48,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:48,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:48,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:48,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:48,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:48,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071532890] [2024-10-11 10:04:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071532890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:48,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:48,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:04:48,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490598455] [2024-10-11 10:04:48,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:48,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:04:48,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:48,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:04:48,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:04:48,968 INFO L87 Difference]: Start difference. First operand 103 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:49,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:49,058 INFO L93 Difference]: Finished difference Result 206 states and 323 transitions. [2024-10-11 10:04:49,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:04:49,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-11 10:04:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:49,063 INFO L225 Difference]: With dead ends: 206 [2024-10-11 10:04:49,063 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 10:04:49,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:04:49,065 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:49,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:49,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 10:04:49,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 10:04:49,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 states have internal predecessors, (102), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:04:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 162 transitions. [2024-10-11 10:04:49,082 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 162 transitions. Word has length 196 [2024-10-11 10:04:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:49,084 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 162 transitions. [2024-10-11 10:04:49,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 162 transitions. [2024-10-11 10:04:49,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-11 10:04:49,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:49,088 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:49,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:04:49,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:49,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:49,090 INFO L85 PathProgramCache]: Analyzing trace with hash 883968966, now seen corresponding path program 1 times [2024-10-11 10:04:49,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:49,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825588470] [2024-10-11 10:04:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:49,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:49,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:49,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:49,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:49,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:49,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:49,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825588470] [2024-10-11 10:04:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825588470] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:49,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:49,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:04:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251092866] [2024-10-11 10:04:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:49,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:04:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:49,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:04:49,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:04:49,388 INFO L87 Difference]: Start difference. First operand 104 states and 162 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:49,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:49,512 INFO L93 Difference]: Finished difference Result 239 states and 369 transitions. [2024-10-11 10:04:49,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:04:49,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 197 [2024-10-11 10:04:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:49,518 INFO L225 Difference]: With dead ends: 239 [2024-10-11 10:04:49,518 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 10:04:49,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:04:49,524 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 43 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:49,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 500 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 10:04:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-11 10:04:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 10:04:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2024-10-11 10:04:49,543 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 197 [2024-10-11 10:04:49,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:49,543 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2024-10-11 10:04:49,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:49,544 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-10-11 10:04:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-11 10:04:49,547 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:49,547 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:49,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:04:49,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:49,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:49,548 INFO L85 PathProgramCache]: Analyzing trace with hash -286179425, now seen corresponding path program 1 times [2024-10-11 10:04:49,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:49,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194315531] [2024-10-11 10:04:49,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:49,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:49,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:49,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:49,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:49,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:49,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194315531] [2024-10-11 10:04:49,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194315531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:49,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:49,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:04:49,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514242441] [2024-10-11 10:04:49,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:49,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:04:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:49,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:04:49,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:04:49,952 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:50,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:50,017 INFO L93 Difference]: Finished difference Result 397 states and 613 transitions. [2024-10-11 10:04:50,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:04:50,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2024-10-11 10:04:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:50,024 INFO L225 Difference]: With dead ends: 397 [2024-10-11 10:04:50,025 INFO L226 Difference]: Without dead ends: 265 [2024-10-11 10:04:50,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:04:50,030 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 106 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:50,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 300 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:04:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-10-11 10:04:50,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2024-10-11 10:04:50,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 188 states have (on average 1.4202127659574468) internal successors, (267), 190 states have internal predecessors, (267), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 10:04:50,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 407 transitions. [2024-10-11 10:04:50,082 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 407 transitions. Word has length 198 [2024-10-11 10:04:50,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:50,083 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 407 transitions. [2024-10-11 10:04:50,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:50,085 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 407 transitions. [2024-10-11 10:04:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-11 10:04:50,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:50,088 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:50,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:04:50,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:50,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash -803234428, now seen corresponding path program 1 times [2024-10-11 10:04:50,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:50,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311915799] [2024-10-11 10:04:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:50,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:50,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:50,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311915799] [2024-10-11 10:04:50,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311915799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:50,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:50,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:04:50,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86711880] [2024-10-11 10:04:50,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:50,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:04:50,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:04:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:04:50,393 INFO L87 Difference]: Start difference. First operand 263 states and 407 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:50,582 INFO L93 Difference]: Finished difference Result 679 states and 1049 transitions. [2024-10-11 10:04:50,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 10:04:50,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2024-10-11 10:04:50,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:50,587 INFO L225 Difference]: With dead ends: 679 [2024-10-11 10:04:50,587 INFO L226 Difference]: Without dead ends: 417 [2024-10-11 10:04:50,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:04:50,588 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 88 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:50,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 655 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:04:50,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-11 10:04:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 409. [2024-10-11 10:04:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 318 states have (on average 1.471698113207547) internal successors, (468), 324 states have internal predecessors, (468), 82 states have call successors, (82), 8 states have call predecessors, (82), 8 states have return successors, (82), 76 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-11 10:04:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 632 transitions. [2024-10-11 10:04:50,634 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 632 transitions. Word has length 199 [2024-10-11 10:04:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:50,635 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 632 transitions. [2024-10-11 10:04:50,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:50,635 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 632 transitions. [2024-10-11 10:04:50,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 10:04:50,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:50,637 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:50,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:04:50,638 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:50,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:50,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1669377379, now seen corresponding path program 1 times [2024-10-11 10:04:50,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:50,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126855243] [2024-10-11 10:04:50,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:50,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:04:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 10:04:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 10:04:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 10:04:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 10:04:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 10:04:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 10:04:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 10:04:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:04:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 10:04:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:04:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:04:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:04:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:04:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:04:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:04:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:04:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:04:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:04:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:04:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:04:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:04:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:04:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 10:04:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 10:04:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 10:04:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 10:04:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 10:04:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 10:04:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 10:04:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-11 10:04:51,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:04:51,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126855243] [2024-10-11 10:04:51,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126855243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:51,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:51,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 10:04:51,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855252348] [2024-10-11 10:04:51,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:51,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:04:51,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:04:51,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:04:51,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:04:51,120 INFO L87 Difference]: Start difference. First operand 409 states and 632 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:51,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:04:51,384 INFO L93 Difference]: Finished difference Result 1005 states and 1527 transitions. [2024-10-11 10:04:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:04:51,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 200 [2024-10-11 10:04:51,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:04:51,389 INFO L225 Difference]: With dead ends: 1005 [2024-10-11 10:04:51,390 INFO L226 Difference]: Without dead ends: 583 [2024-10-11 10:04:51,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:04:51,393 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 186 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:04:51,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 563 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:04:51,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-11 10:04:51,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 383. [2024-10-11 10:04:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 304 states have (on average 1.4605263157894737) internal successors, (444), 306 states have internal predecessors, (444), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 10:04:51,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2024-10-11 10:04:51,445 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 200 [2024-10-11 10:04:51,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:04:51,446 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2024-10-11 10:04:51,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-11 10:04:51,446 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2024-10-11 10:04:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 10:04:51,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:51,448 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:04:51,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:51,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash 934696554, now seen corresponding path program 1 times [2024-10-11 10:04:51,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:04:51,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256451658] [2024-10-11 10:04:51,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:51,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:04:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:04:51,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:04:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:04:51,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:04:51,747 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:04:51,748 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:04:51,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:04:51,753 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:51,901 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:04:51,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:04:51 BoogieIcfgContainer [2024-10-11 10:04:51,904 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:04:51,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:04:51,904 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:04:51,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:04:51,905 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:47" (3/4) ... [2024-10-11 10:04:51,907 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:04:51,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:04:51,908 INFO L158 Benchmark]: Toolchain (without parser) took 5665.94ms. Allocated memory was 165.7MB in the beginning and 297.8MB in the end (delta: 132.1MB). Free memory was 94.4MB in the beginning and 227.6MB in the end (delta: -133.3MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,909 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:04:51,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.12ms. Allocated memory is still 165.7MB. Free memory was 94.0MB in the beginning and 133.7MB in the end (delta: -39.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.48ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 129.6MB in the end (delta: 4.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,910 INFO L158 Benchmark]: Boogie Preprocessor took 85.74ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 123.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,910 INFO L158 Benchmark]: RCFGBuilder took 686.74ms. Allocated memory is still 165.7MB. Free memory was 123.9MB in the beginning and 90.9MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,910 INFO L158 Benchmark]: TraceAbstraction took 4371.19ms. Allocated memory was 165.7MB in the beginning and 297.8MB in the end (delta: 132.1MB). Free memory was 90.3MB in the beginning and 227.6MB in the end (delta: -137.3MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2024-10-11 10:04:51,910 INFO L158 Benchmark]: Witness Printer took 3.81ms. Allocated memory is still 297.8MB. Free memory is still 227.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:04:51,914 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.18ms. Allocated memory is still 165.7MB. Free memory is still 120.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.12ms. Allocated memory is still 165.7MB. Free memory was 94.0MB in the beginning and 133.7MB in the end (delta: -39.6MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.48ms. Allocated memory is still 165.7MB. Free memory was 133.7MB in the beginning and 129.6MB in the end (delta: 4.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.74ms. Allocated memory is still 165.7MB. Free memory was 129.6MB in the beginning and 123.9MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 686.74ms. Allocated memory is still 165.7MB. Free memory was 123.9MB in the beginning and 90.9MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4371.19ms. Allocated memory was 165.7MB in the beginning and 297.8MB in the end (delta: 132.1MB). Free memory was 90.3MB in the beginning and 227.6MB in the end (delta: -137.3MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. * Witness Printer took 3.81ms. Allocated memory is still 297.8MB. Free memory is still 227.6MB. 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 181, overapproximation of someBinaryArithmeticFLOAToperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] float var_1_2 = 200.875; [L24] float var_1_3 = 100.25; [L25] float var_1_4 = 99999999.34; [L26] unsigned short int var_1_5 = 10; [L27] unsigned short int var_1_6 = 8; [L28] unsigned long int var_1_7 = 25; [L29] unsigned char var_1_8 = 0; [L30] signed long int var_1_9 = -16; [L31] unsigned short int var_1_10 = 25; [L32] unsigned short int var_1_11 = 10000; [L33] signed short int var_1_12 = -32; [L34] signed char var_1_13 = 4; [L35] signed char var_1_14 = 25; [L36] signed short int var_1_15 = -16; [L37] signed short int var_1_16 = 100; [L38] signed short int var_1_17 = 8; [L39] float var_1_18 = 5.8; [L40] float var_1_19 = 0.19999999999999996; [L41] float var_1_20 = 1.5; [L42] float var_1_21 = 10000000.5; [L43] float var_1_22 = 4.5; [L44] float var_1_23 = 4.25; [L45] signed short int var_1_24 = -16; [L46] unsigned short int var_1_25 = 100; [L47] unsigned long int var_1_27 = 8; [L48] signed long int var_1_34 = 8; [L49] unsigned char var_1_36 = 0; [L50] unsigned char var_1_37 = 0; [L51] unsigned char var_1_38 = 1; [L52] float var_1_39 = 10000000000000.5; [L53] float var_1_43 = 0.0; [L54] float var_1_44 = 0.4; [L55] signed long int var_1_45 = -128; [L56] signed short int var_1_46 = 2; [L185] isInitial = 1 [L186] FCALL initially() [L187] COND TRUE 1 [L188] FCALL updateLastVariables() [L189] CALL updateVariables() [L127] var_1_2 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L128] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_3=401/4, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L129] var_1_3 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L130] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_4=4999999967/50, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L131] var_1_4 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L132] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=10, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L133] var_1_5 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L134] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L135] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=8, var_1_7=25, var_1_8=0, var_1_9=-16] [L136] var_1_6 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L137] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L138] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_9=-16] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_9=-16] [L141] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L141] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=25, var_1_11=10000, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L142] var_1_11 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=25, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L144] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=4, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L146] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L147] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=25, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L150] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=100, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L151] var_1_16 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L152] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] CALL assume_abort_if_not(var_1_16 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L153] RET assume_abort_if_not(var_1_16 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=8, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L154] var_1_17 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L155] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] CALL assume_abort_if_not(var_1_17 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L156] RET assume_abort_if_not(var_1_17 <= 16383) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_19=4999999999999999/25000000000000000, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L157] var_1_19 = __VERIFIER_nondet_float() [L158] 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, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L158] 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, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_20=3/2, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L159] var_1_20 = __VERIFIER_nondet_float() [L160] 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, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L160] 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, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_21=20000001/2, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L161] var_1_21 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L162] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_22=9/2, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L163] var_1_22 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L164] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_23=17/4, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L165] var_1_23 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L166] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=8, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L167] var_1_27 = __VERIFIER_nondet_ulong() [L168] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L168] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] CALL assume_abort_if_not(var_1_27 <= 17) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L169] RET assume_abort_if_not(var_1_27 <= 17) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L170] var_1_37 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L171] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] CALL assume_abort_if_not(var_1_37 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L172] RET assume_abort_if_not(var_1_37 <= 0) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_43=0, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L173] var_1_43 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L174] RET assume_abort_if_not((var_1_43 >= 4611686.018427382800e+12F && var_1_43 <= -1.0e-20F) || (var_1_43 <= 9223372.036854765600e+12F && var_1_43 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_44=2/5, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L175] var_1_44 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L176] RET assume_abort_if_not((var_1_44 >= 0.0F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 4611686.018427382800e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L189] RET updateVariables() [L190] CALL step() [L60] EXPR var_1_5 >> var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L60] EXPR var_1_10 ^ var_1_14 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=100, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L60] COND FALSE !((var_1_5 >> var_1_27) > ((var_1_10 ^ var_1_14) + ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) [L63] COND TRUE ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) >= (var_1_4 - var_1_3) [L64] var_1_25 = var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR var_1_5 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR ((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR var_1_5 | var_1_27 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] EXPR ((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=8, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L67] COND TRUE var_1_16 >= ((((var_1_5 | var_1_27) < 0 ) ? -(var_1_5 | var_1_27) : (var_1_5 | var_1_27))) [L68] var_1_34 = (((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) > (var_1_16)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_16))) - ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] EXPR -10 & var_1_5 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=0, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L76] COND TRUE (-10 & var_1_5) <= var_1_6 [L77] COND TRUE var_1_4 != var_1_4 [L78] var_1_36 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=1, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L81] var_1_38 = var_1_37 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L82] EXPR var_1_6 ^ var_1_17 VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_39=20000000000001/2, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L82] COND FALSE !(var_1_27 == (var_1_6 ^ var_1_17)) [L85] var_1_39 = (((((((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) < (var_1_43)) ? (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) : (var_1_43))) - 255.4f) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=-128, var_1_46=2, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=-16] [L87] var_1_45 = var_1_27 [L88] var_1_46 = var_1_27 [L89] var_1_9 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) [L90] signed long int stepLocal_1 = 56016 - var_1_11; [L91] signed long int stepLocal_0 = 10; VAL [isInitial=1, stepLocal_0=10, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L92] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=-32, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L97] COND FALSE !((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) [L102] var_1_12 = var_1_14 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-16, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L104] var_1_15 = (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4)))) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_18=29/5, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L105] COND TRUE var_1_4 > var_1_2 [L106] var_1_18 = (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=32, var_1_24=-16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L114] var_1_24 = 16 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=32, var_1_24=16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L115] COND TRUE var_1_18 <= (var_1_3 - var_1_4) [L116] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L120] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, stepLocal_1=23249, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L190] RET step() [L191] CALL, EXPR property() [L181-L182] return ((((((((var_1_18 <= (var_1_3 - var_1_4)) ? (var_1_1 == ((unsigned short int) var_1_5)) : (var_1_1 == ((unsigned short int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && (var_1_8 ? ((var_1_5 < 16) ? (var_1_7 == ((unsigned long int) (var_1_6 + var_1_24))) : 1) : 1)) && (var_1_9 == ((signed long int) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6)))))) && ((var_1_6 < 10) ? ((var_1_5 < (56016 - var_1_11)) ? (var_1_10 == ((unsigned short int) var_1_5)) : 1) : 1)) && (((var_1_13 - var_1_14) > (var_1_10 + var_1_11)) ? ((! var_1_8) ? (var_1_12 == ((signed short int) var_1_13)) : 1) : (var_1_12 == ((signed short int) var_1_14)))) && (var_1_15 == ((signed short int) (var_1_14 - (((((var_1_16 + var_1_17)) > (4)) ? ((var_1_16 + var_1_17)) : (4))))))) && ((var_1_4 > var_1_2) ? (var_1_18 == ((float) (((((var_1_19 + var_1_20) < 0 ) ? -(var_1_19 + var_1_20) : (var_1_19 + var_1_20))) - var_1_21))) : ((! ((var_1_17 - var_1_11) < 128)) ? (var_1_18 == ((float) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_18 == ((float) ((((((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) < ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))) ? (((((9.75f) > (var_1_19)) ? (9.75f) : (var_1_19)))) : ((((((var_1_21 - var_1_22)) > (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23))))) ? ((var_1_21 - var_1_22)) : (((((var_1_20) > (var_1_23)) ? (var_1_20) : (var_1_23)))))))))))))) && (var_1_24 == ((signed short int) 16)) ; [L191] RET, EXPR property() [L191] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] [L19] reach_error() VAL [isInitial=1, var_1_10=25, var_1_11=32767, var_1_12=0, var_1_13=1, var_1_14=0, var_1_15=-17, var_1_16=17, var_1_17=0, var_1_1=0, var_1_24=16, var_1_25=17, var_1_27=17, var_1_34=32767, var_1_36=-256, var_1_37=-256, var_1_38=-256, var_1_45=17, var_1_46=17, var_1_5=0, var_1_6=65534, var_1_7=25, var_1_8=0, var_1_9=65534] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.1s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 2628 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1668 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 960 mSDtfsCounter, 452 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=409occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 213 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1386 NumberOfCodeBlocks, 1386 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:04:51,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:04:54,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:04:54,249 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:04:54,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:04:54,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:04:54,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:04:54,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:04:54,291 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:04:54,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:04:54,292 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:04:54,292 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:04:54,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:04:54,293 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:04:54,295 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:04:54,295 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:04:54,296 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:04:54,296 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:04:54,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:04:54,296 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:04:54,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:04:54,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:04:54,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:04:54,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:04:54,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:04:54,302 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:04:54,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:04:54,302 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:04:54,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:04:54,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:04:54,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:04:54,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:04:54,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:04:54,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:04:54,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:04:54,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:54,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:04:54,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:04:54,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:04:54,305 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:04:54,305 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:04:54,305 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:04:54,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:04:54,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:04:54,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:04:54,308 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:04:54,308 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2443bff004680acf9358dc6eb7b3ebb2c0abce0266843d4c0b3809d4105241e0 [2024-10-11 10:04:54,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:04:54,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:04:54,670 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:04:54,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:04:54,671 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:04:54,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:56,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:04:56,374 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:04:56,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:56,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c39ac0870/5c90fb1c701a490783e20be02051c33e/FLAG64422b590 [2024-10-11 10:04:56,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c39ac0870/5c90fb1c701a490783e20be02051c33e [2024-10-11 10:04:56,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:04:56,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:04:56,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:56,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:04:56,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:04:56,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:56" (1/1) ... [2024-10-11 10:04:56,739 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448ad4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:56, skipping insertion in model container [2024-10-11 10:04:56,739 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:04:56" (1/1) ... [2024-10-11 10:04:56,784 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:04:56,964 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-10-11 10:04:57,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:57,075 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:04:57,089 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i[918,931] [2024-10-11 10:04:57,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:04:57,172 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:04:57,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57 WrapperNode [2024-10-11 10:04:57,173 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:04:57,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:57,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:04:57,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:04:57,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,240 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-11 10:04:57,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:04:57,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:04:57,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:04:57,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:04:57,257 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,290 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:04:57,292 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,292 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,320 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:04:57,328 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:04:57,328 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:04:57,328 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:04:57,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (1/1) ... [2024-10-11 10:04:57,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:04:57,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:04:57,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:04:57,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:04:57,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:04:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:04:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:04:57,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:04:57,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:04:57,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:04:57,529 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:04:57,532 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:04:58,991 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:04:58,991 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:04:59,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:04:59,058 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:04:59,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:59 BoogieIcfgContainer [2024-10-11 10:04:59,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:04:59,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:04:59,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:04:59,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:04:59,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:04:56" (1/3) ... [2024-10-11 10:04:59,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1e239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:59, skipping insertion in model container [2024-10-11 10:04:59,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:04:57" (2/3) ... [2024-10-11 10:04:59,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a1e239 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:04:59, skipping insertion in model container [2024-10-11 10:04:59,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:04:59" (3/3) ... [2024-10-11 10:04:59,078 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-7.i [2024-10-11 10:04:59,097 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:04:59,098 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:04:59,173 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:04:59,181 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;@1501d9d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:04:59,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:04:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:04:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:04:59,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:04:59,203 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:04:59,203 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:04:59,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:04:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 2107603678, now seen corresponding path program 1 times [2024-10-11 10:04:59,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:04:59,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [411712345] [2024-10-11 10:04:59,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:04:59,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:04:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:04:59,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:04:59,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:04:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:04:59,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:04:59,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:04:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 962 trivial. 0 not checked. [2024-10-11 10:04:59,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:04:59,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:04:59,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [411712345] [2024-10-11 10:04:59,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [411712345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:04:59,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:04:59,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:04:59,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37443853] [2024-10-11 10:04:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:04:59,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:04:59,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:04:59,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:04:59,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:04:59,822 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:05:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:05:00,382 INFO L93 Difference]: Finished difference Result 165 states and 294 transitions. [2024-10-11 10:05:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:05:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 188 [2024-10-11 10:05:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:05:00,401 INFO L225 Difference]: With dead ends: 165 [2024-10-11 10:05:00,401 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 10:05:00,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:05:00,408 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:05:00,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:05:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 10:05:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 10:05:00,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 10:05:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2024-10-11 10:05:00,460 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 188 [2024-10-11 10:05:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:05:00,460 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2024-10-11 10:05:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-11 10:05:00,461 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2024-10-11 10:05:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 10:05:00,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:05:00,467 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:05:00,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:05:00,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:05:00,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:05:00,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:05:00,671 INFO L85 PathProgramCache]: Analyzing trace with hash -820769846, now seen corresponding path program 1 times [2024-10-11 10:05:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:05:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212598045] [2024-10-11 10:05:00,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:05:00,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:05:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:05:00,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:05:00,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:05:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:05:01,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 10:05:01,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:05:16,126 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 10:05:38,405 WARN L286 SmtUtils]: Spent 9.91s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)