./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-cn_file-4.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-cn_file-4.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 2a17d360b20bc2aef487820935da4493eeb86b5990f7bfc304c1b85cdc64ccf7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:12:08,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:12:08,090 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:12:08,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:12:08,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:12:08,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:12:08,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:12:08,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:12:08,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:12:08,116 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:12:08,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:12:08,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:12:08,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:12:08,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:12:08,117 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:12:08,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:12:08,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:12:08,118 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:12:08,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:12:08,119 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:12:08,119 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:12:08,123 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:12:08,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:12:08,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:12:08,124 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:12:08,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:12:08,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:12:08,125 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:12:08,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:12:08,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:12:08,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:12:08,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:12:08,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:12:08,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:12:08,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:12:08,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:12:08,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:12:08,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:12:08,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:12:08,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:12:08,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:12:08,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:12:08,132 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 -> 2a17d360b20bc2aef487820935da4493eeb86b5990f7bfc304c1b85cdc64ccf7 [2024-10-11 10:12:08,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:12:08,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:12:08,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:12:08,389 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:12:08,389 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:12:08,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:12:09,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:12:10,213 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:12:10,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:12:10,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aeab8c4f/daba316c3d8b487880d36c911b814e74/FLAGe2e9796e6 [2024-10-11 10:12:10,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5aeab8c4f/daba316c3d8b487880d36c911b814e74 [2024-10-11 10:12:10,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:12:10,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:12:10,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:12:10,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:12:10,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:12:10,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:10,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9c4439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10, skipping insertion in model container [2024-10-11 10:12:10,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:10,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:12:10,737 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-cn_file-4.i[918,931] [2024-10-11 10:12:10,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:12:10,843 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:12:10,856 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-cn_file-4.i[918,931] [2024-10-11 10:12:10,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:12:10,961 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:12:10,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10 WrapperNode [2024-10-11 10:12:10,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:12:10,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:12:10,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:12:10,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:12:10,994 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:12:10" (1/1) ... [2024-10-11 10:12:11,007 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:12:10" (1/1) ... [2024-10-11 10:12:11,041 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 255 [2024-10-11 10:12:11,041 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:12:11,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:12:11,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:12:11,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:12:11,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,090 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:12:11,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:12:11,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:12:11,121 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:12:11,121 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:12:11,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (1/1) ... [2024-10-11 10:12:11,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:12:11,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:12:11,169 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:12:11,175 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:12:11,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:12:11,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:12:11,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:12:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:12:11,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:12:11,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:12:11,293 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:12:11,295 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:12:11,627 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 10:12:11,627 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:12:11,660 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:12:11,660 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:12:11,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:12:11 BoogieIcfgContainer [2024-10-11 10:12:11,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:12:11,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:12:11,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:12:11,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:12:11,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:12:10" (1/3) ... [2024-10-11 10:12:11,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f7ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:12:11, skipping insertion in model container [2024-10-11 10:12:11,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:12:10" (2/3) ... [2024-10-11 10:12:11,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60f7ee55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:12:11, skipping insertion in model container [2024-10-11 10:12:11,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:12:11" (3/3) ... [2024-10-11 10:12:11,668 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:12:11,682 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:12:11,683 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:12:11,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:12:11,745 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;@4faea76f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:12:11,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:12:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:12:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 10:12:11,770 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:11,771 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:11,772 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:11,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:11,779 INFO L85 PathProgramCache]: Analyzing trace with hash 978494061, now seen corresponding path program 1 times [2024-10-11 10:12:11,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:11,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061917086] [2024-10-11 10:12:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:11,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:12,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:12,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:12,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061917086] [2024-10-11 10:12:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061917086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:12,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:12:12,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552620697] [2024-10-11 10:12:12,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:12:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:12,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:12:12,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:12:12,480 INFO L87 Difference]: Start difference. First operand has 105 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:12,572 INFO L93 Difference]: Finished difference Result 207 states and 382 transitions. [2024-10-11 10:12:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:12:12,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 244 [2024-10-11 10:12:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:12,586 INFO L225 Difference]: With dead ends: 207 [2024-10-11 10:12:12,587 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 10:12:12,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 82 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:12:12,595 INFO L432 NwaCegarLoop]: 163 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, 163 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:12:12,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:12:12,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 10:12:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-11 10:12:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:12:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 166 transitions. [2024-10-11 10:12:12,645 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 166 transitions. Word has length 244 [2024-10-11 10:12:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:12,647 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 166 transitions. [2024-10-11 10:12:12,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 166 transitions. [2024-10-11 10:12:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:12:12,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:12,651 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:12,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:12:12,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:12,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:12,652 INFO L85 PathProgramCache]: Analyzing trace with hash 257860596, now seen corresponding path program 1 times [2024-10-11 10:12:12,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:12,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922601471] [2024-10-11 10:12:12,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:12,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:13,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922601471] [2024-10-11 10:12:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922601471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:13,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:13,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:12:13,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782878301] [2024-10-11 10:12:13,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:13,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:12:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:12:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:12:13,598 INFO L87 Difference]: Start difference. First operand 103 states and 166 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:12:14,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:14,407 INFO L93 Difference]: Finished difference Result 470 states and 746 transitions. [2024-10-11 10:12:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:12:14,408 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 245 [2024-10-11 10:12:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:14,412 INFO L225 Difference]: With dead ends: 470 [2024-10-11 10:12:14,412 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 10:12:14,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:12:14,414 INFO L432 NwaCegarLoop]: 284 mSDtfsCounter, 583 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:14,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 527 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:12:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 10:12:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 237. [2024-10-11 10:12:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 134 states have internal predecessors, (178), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 98 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-11 10:12:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 378 transitions. [2024-10-11 10:12:14,488 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 378 transitions. Word has length 245 [2024-10-11 10:12:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:14,489 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 378 transitions. [2024-10-11 10:12:14,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:12:14,489 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 378 transitions. [2024-10-11 10:12:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:12:14,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:14,493 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:12:14,494 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:14,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:14,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1431083146, now seen corresponding path program 1 times [2024-10-11 10:12:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434879300] [2024-10-11 10:12:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434879300] [2024-10-11 10:12:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434879300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:12:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153115353] [2024-10-11 10:12:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:12:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:12:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:12:19,341 INFO L87 Difference]: Start difference. First operand 237 states and 378 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:21,063 INFO L93 Difference]: Finished difference Result 668 states and 1045 transitions. [2024-10-11 10:12:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:12:21,063 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:12:21,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:21,069 INFO L225 Difference]: With dead ends: 668 [2024-10-11 10:12:21,069 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 10:12:21,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:12:21,071 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 234 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:21,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 813 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:12:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 10:12:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 233. [2024-10-11 10:12:21,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 148 states have (on average 1.412162162162162) internal successors, (209), 148 states have internal predecessors, (209), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 10:12:21,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 369 transitions. [2024-10-11 10:12:21,108 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 369 transitions. Word has length 245 [2024-10-11 10:12:21,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:21,109 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 369 transitions. [2024-10-11 10:12:21,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:21,109 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 369 transitions. [2024-10-11 10:12:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:12:21,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:21,111 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:21,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:12:21,112 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:21,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1431142728, now seen corresponding path program 1 times [2024-10-11 10:12:21,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:21,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946858877] [2024-10-11 10:12:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:21,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:21,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:21,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:21,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946858877] [2024-10-11 10:12:21,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946858877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:21,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:21,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:12:21,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591890060] [2024-10-11 10:12:21,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:21,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:12:21,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:21,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:12:21,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:12:21,666 INFO L87 Difference]: Start difference. First operand 233 states and 369 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:21,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:21,950 INFO L93 Difference]: Finished difference Result 485 states and 764 transitions. [2024-10-11 10:12:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:12:21,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:12:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:21,954 INFO L225 Difference]: With dead ends: 485 [2024-10-11 10:12:21,954 INFO L226 Difference]: Without dead ends: 372 [2024-10-11 10:12:21,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:12:21,956 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 204 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:21,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 682 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:12:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-10-11 10:12:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 348. [2024-10-11 10:12:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 221 states have (on average 1.411764705882353) internal successors, (312), 221 states have internal predecessors, (312), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:12:22,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 552 transitions. [2024-10-11 10:12:22,022 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 552 transitions. Word has length 245 [2024-10-11 10:12:22,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:22,023 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 552 transitions. [2024-10-11 10:12:22,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 552 transitions. [2024-10-11 10:12:22,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:22,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:22,027 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:12:22,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1109648389, now seen corresponding path program 1 times [2024-10-11 10:12:22,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:22,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542497402] [2024-10-11 10:12:22,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:22,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:22,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:22,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:12:22,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542497402] [2024-10-11 10:12:22,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542497402] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:12:22,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133329287] [2024-10-11 10:12:22,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:22,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:12:22,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:12:22,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:12:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:22,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:12:22,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:12:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 477 proven. 108 refuted. 0 times theorem prover too weak. 2535 trivial. 0 not checked. [2024-10-11 10:12:22,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:12:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 108 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:12:23,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133329287] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:12:23,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:12:23,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 10:12:23,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209661567] [2024-10-11 10:12:23,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:12:23,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 10:12:23,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 10:12:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:12:23,169 INFO L87 Difference]: Start difference. First operand 348 states and 552 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2024-10-11 10:12:23,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:23,403 INFO L93 Difference]: Finished difference Result 602 states and 936 transitions. [2024-10-11 10:12:23,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:12:23,404 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) Word has length 246 [2024-10-11 10:12:23,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:23,406 INFO L225 Difference]: With dead ends: 602 [2024-10-11 10:12:23,406 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 10:12:23,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 567 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:12:23,408 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 51 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:23,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 256 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:12:23,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 10:12:23,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 342. [2024-10-11 10:12:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 212 states have (on average 1.3537735849056605) internal successors, (287), 212 states have internal predecessors, (287), 120 states have call successors, (120), 9 states have call predecessors, (120), 9 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:12:23,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 527 transitions. [2024-10-11 10:12:23,451 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 527 transitions. Word has length 246 [2024-10-11 10:12:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:23,452 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 527 transitions. [2024-10-11 10:12:23,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 2 states have call successors, (77) [2024-10-11 10:12:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 527 transitions. [2024-10-11 10:12:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:23,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:23,454 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:23,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:12:23,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:23,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:23,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1515632244, now seen corresponding path program 1 times [2024-10-11 10:12:23,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:23,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094757997] [2024-10-11 10:12:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:23,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:23,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:23,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:23,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:23,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:23,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:23,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:23,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094757997] [2024-10-11 10:12:23,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094757997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:23,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:23,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:12:23,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840842784] [2024-10-11 10:12:23,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:23,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:12:23,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:23,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:12:23,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:12:23,830 INFO L87 Difference]: Start difference. First operand 342 states and 527 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:23,893 INFO L93 Difference]: Finished difference Result 686 states and 1059 transitions. [2024-10-11 10:12:23,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:12:23,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 246 [2024-10-11 10:12:23,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:23,897 INFO L225 Difference]: With dead ends: 686 [2024-10-11 10:12:23,897 INFO L226 Difference]: Without dead ends: 457 [2024-10-11 10:12:23,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 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:12:23,899 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 151 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:23,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 313 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:12:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-11 10:12:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2024-10-11 10:12:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 282 states have (on average 1.3581560283687943) internal successors, (383), 282 states have internal predecessors, (383), 160 states have call successors, (160), 12 states have call predecessors, (160), 12 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 10:12:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 703 transitions. [2024-10-11 10:12:23,953 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 703 transitions. Word has length 246 [2024-10-11 10:12:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:23,953 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 703 transitions. [2024-10-11 10:12:23,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 703 transitions. [2024-10-11 10:12:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:23,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:23,956 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:23,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:12:23,956 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:23,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1515691826, now seen corresponding path program 1 times [2024-10-11 10:12:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:23,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546226718] [2024-10-11 10:12:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:24,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:24,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:24,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:24,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:24,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:24,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:12:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546226718] [2024-10-11 10:12:24,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546226718] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:12:24,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591283897] [2024-10-11 10:12:24,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:24,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:24,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:12:24,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:12:24,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:12:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:24,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:12:24,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:12:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 193 proven. 114 refuted. 0 times theorem prover too weak. 2813 trivial. 0 not checked. [2024-10-11 10:12:24,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:12:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:12:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591283897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:12:25,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:12:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-10-11 10:12:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842923485] [2024-10-11 10:12:25,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:12:25,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:12:25,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:25,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:12:25,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:12:25,116 INFO L87 Difference]: Start difference. First operand 455 states and 703 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2024-10-11 10:12:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:26,113 INFO L93 Difference]: Finished difference Result 849 states and 1282 transitions. [2024-10-11 10:12:26,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 10:12:26,115 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 246 [2024-10-11 10:12:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:26,118 INFO L225 Difference]: With dead ends: 849 [2024-10-11 10:12:26,119 INFO L226 Difference]: Without dead ends: 503 [2024-10-11 10:12:26,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 564 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-10-11 10:12:26,120 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 198 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:26,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 991 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 10:12:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-10-11 10:12:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 465. [2024-10-11 10:12:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 289 states have (on average 1.342560553633218) internal successors, (388), 289 states have internal predecessors, (388), 160 states have call successors, (160), 15 states have call predecessors, (160), 15 states have return successors, (160), 160 states have call predecessors, (160), 160 states have call successors, (160) [2024-10-11 10:12:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 708 transitions. [2024-10-11 10:12:26,176 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 708 transitions. Word has length 246 [2024-10-11 10:12:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 708 transitions. [2024-10-11 10:12:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 11 states have internal predecessors, (64), 2 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2024-10-11 10:12:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 708 transitions. [2024-10-11 10:12:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:26,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:26,179 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:12:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:26,384 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:26,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:26,384 INFO L85 PathProgramCache]: Analyzing trace with hash -410189107, now seen corresponding path program 1 times [2024-10-11 10:12:26,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:26,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106826425] [2024-10-11 10:12:26,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:26,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:26,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:26,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106826425] [2024-10-11 10:12:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106826425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:12:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369305927] [2024-10-11 10:12:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:12:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:26,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:12:26,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:12:26,488 INFO L87 Difference]: Start difference. First operand 465 states and 708 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:26,566 INFO L93 Difference]: Finished difference Result 825 states and 1251 transitions. [2024-10-11 10:12:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:12:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 246 [2024-10-11 10:12:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:26,569 INFO L225 Difference]: With dead ends: 825 [2024-10-11 10:12:26,569 INFO L226 Difference]: Without dead ends: 469 [2024-10-11 10:12:26,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:12:26,572 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 151 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:26,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 309 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:12:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-11 10:12:26,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 350. [2024-10-11 10:12:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 218 states have (on average 1.334862385321101) internal successors, (291), 218 states have internal predecessors, (291), 120 states have call successors, (120), 11 states have call predecessors, (120), 11 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-11 10:12:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2024-10-11 10:12:26,620 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 246 [2024-10-11 10:12:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:26,622 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2024-10-11 10:12:26,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2024-10-11 10:12:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:26,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:26,624 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:26,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:12:26,625 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:26,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:26,625 INFO L85 PathProgramCache]: Analyzing trace with hash -410248689, now seen corresponding path program 1 times [2024-10-11 10:12:26,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:26,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534244608] [2024-10-11 10:12:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:26,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:26,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:26,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:26,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:26,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:12:26,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:26,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534244608] [2024-10-11 10:12:26,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534244608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:12:26,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:12:26,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:12:26,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599241008] [2024-10-11 10:12:26,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:12:26,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:12:26,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:26,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:12:26,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:12:26,827 INFO L87 Difference]: Start difference. First operand 350 states and 531 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:27,220 INFO L93 Difference]: Finished difference Result 816 states and 1236 transitions. [2024-10-11 10:12:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:12:27,223 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 246 [2024-10-11 10:12:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:27,234 INFO L225 Difference]: With dead ends: 816 [2024-10-11 10:12:27,234 INFO L226 Difference]: Without dead ends: 579 [2024-10-11 10:12:27,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 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:12:27,235 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 162 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:27,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 648 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:12:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-10-11 10:12:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 576. [2024-10-11 10:12:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 356 states have (on average 1.3286516853932584) internal successors, (473), 356 states have internal predecessors, (473), 200 states have call successors, (200), 19 states have call predecessors, (200), 19 states have return successors, (200), 200 states have call predecessors, (200), 200 states have call successors, (200) [2024-10-11 10:12:27,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 873 transitions. [2024-10-11 10:12:27,381 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 873 transitions. Word has length 246 [2024-10-11 10:12:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:27,381 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 873 transitions. [2024-10-11 10:12:27,382 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, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:12:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 873 transitions. [2024-10-11 10:12:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:12:27,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:27,386 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:27,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:12:27,387 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:27,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1219595315, now seen corresponding path program 1 times [2024-10-11 10:12:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:27,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179504667] [2024-10-11 10:12:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:27,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:12:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:12:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:12:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:12:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:12:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:12:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:12:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:12:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 10:12:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:12:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:12:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 10:12:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 10:12:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 10:12:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 10:12:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 10:12:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 10:12:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 10:12:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 10:12:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 10:12:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 10:12:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 10:12:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 10:12:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:12:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:12:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:12:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:12:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:12:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:12:28,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:12:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:12:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 10:12:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:12:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 10:12:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-11 10:12:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 10:12:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-11 10:12:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-11 10:12:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-11 10:12:28,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-11 10:12:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 24 proven. 93 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:12:28,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:12:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179504667] [2024-10-11 10:12:28,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179504667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:12:28,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204984026] [2024-10-11 10:12:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:28,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:28,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:12:28,374 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:12:28,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 10:12:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:12:28,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 10:12:28,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:12:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1131 proven. 426 refuted. 0 times theorem prover too weak. 1563 trivial. 0 not checked. [2024-10-11 10:12:32,267 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:12:52,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 87 proven. 363 refuted. 0 times theorem prover too weak. 2670 trivial. 0 not checked. [2024-10-11 10:12:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204984026] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:12:52,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:12:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19, 18] total 42 [2024-10-11 10:12:52,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188682202] [2024-10-11 10:12:52,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:12:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 10:12:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:12:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 10:12:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1274, Unknown=0, NotChecked=0, Total=1722 [2024-10-11 10:12:52,269 INFO L87 Difference]: Start difference. First operand 576 states and 873 transitions. Second operand has 42 states, 40 states have (on average 4.0) internal successors, (160), 38 states have internal predecessors, (160), 14 states have call successors, (120), 7 states have call predecessors, (120), 14 states have return successors, (120), 14 states have call predecessors, (120), 14 states have call successors, (120) [2024-10-11 10:12:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:12:56,385 INFO L93 Difference]: Finished difference Result 955 states and 1367 transitions. [2024-10-11 10:12:56,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-11 10:12:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 4.0) internal successors, (160), 38 states have internal predecessors, (160), 14 states have call successors, (120), 7 states have call predecessors, (120), 14 states have return successors, (120), 14 states have call predecessors, (120), 14 states have call successors, (120) Word has length 246 [2024-10-11 10:12:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:12:56,398 INFO L225 Difference]: With dead ends: 955 [2024-10-11 10:12:56,398 INFO L226 Difference]: Without dead ends: 484 [2024-10-11 10:12:56,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 558 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3905 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=3249, Invalid=9633, Unknown=0, NotChecked=0, Total=12882 [2024-10-11 10:12:56,411 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1303 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 1259 mSolverCounterSat, 897 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1303 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 897 IncrementalHoareTripleChecker+Valid, 1259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 10:12:56,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1303 Valid, 982 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [897 Valid, 1259 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 10:12:56,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-11 10:12:56,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 441. [2024-10-11 10:12:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 282 states have (on average 1.24822695035461) internal successors, (352), 283 states have internal predecessors, (352), 128 states have call successors, (128), 30 states have call predecessors, (128), 30 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2024-10-11 10:12:56,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 608 transitions. [2024-10-11 10:12:56,595 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 608 transitions. Word has length 246 [2024-10-11 10:12:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:12:56,596 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 608 transitions. [2024-10-11 10:12:56,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 4.0) internal successors, (160), 38 states have internal predecessors, (160), 14 states have call successors, (120), 7 states have call predecessors, (120), 14 states have return successors, (120), 14 states have call predecessors, (120), 14 states have call successors, (120) [2024-10-11 10:12:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 608 transitions. [2024-10-11 10:12:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-10-11 10:12:56,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:12:56,602 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:56,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 10:12:56,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:56,807 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:12:56,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:12:56,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1263696569, now seen corresponding path program 1 times [2024-10-11 10:12:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:12:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074154181] [2024-10-11 10:12:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:12:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:12:56,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [797394329] [2024-10-11 10:12:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:12:56,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:12:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:12:56,894 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:12:56,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 10:12:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:12:57,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:12:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:12:57,204 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:12:57,205 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:12:57,205 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:12:57,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 10:12:57,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 10:12:57,411 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:12:57,546 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:12:57,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:12:57 BoogieIcfgContainer [2024-10-11 10:12:57,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:12:57,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:12:57,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:12:57,549 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:12:57,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:12:11" (3/4) ... [2024-10-11 10:12:57,550 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:12:57,551 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:12:57,552 INFO L158 Benchmark]: Toolchain (without parser) took 47028.38ms. Allocated memory was 138.4MB in the beginning and 903.9MB in the end (delta: 765.5MB). Free memory was 67.1MB in the beginning and 458.3MB in the end (delta: -391.2MB). Peak memory consumption was 376.2MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,552 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory was 90.3MB in the beginning and 90.0MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:12:57,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.61ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 107.1MB in the end (delta: -40.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.12ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 107.0MB in the beginning and 164.4MB in the end (delta: -57.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,553 INFO L158 Benchmark]: Boogie Preprocessor took 74.33ms. Allocated memory is still 197.1MB. Free memory was 164.4MB in the beginning and 159.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,553 INFO L158 Benchmark]: RCFGBuilder took 540.13ms. Allocated memory is still 197.1MB. Free memory was 159.2MB in the beginning and 122.5MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,553 INFO L158 Benchmark]: TraceAbstraction took 45885.48ms. Allocated memory was 197.1MB in the beginning and 903.9MB in the end (delta: 706.7MB). Free memory was 121.4MB in the beginning and 459.3MB in the end (delta: -337.9MB). Peak memory consumption was 368.9MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,553 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 903.9MB. Free memory was 459.3MB in the beginning and 458.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 10:12:57,554 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 138.4MB. Free memory was 90.3MB in the beginning and 90.0MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.61ms. Allocated memory is still 138.4MB. Free memory was 66.9MB in the beginning and 107.1MB in the end (delta: -40.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.12ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 107.0MB in the beginning and 164.4MB in the end (delta: -57.4MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.33ms. Allocated memory is still 197.1MB. Free memory was 164.4MB in the beginning and 159.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 540.13ms. Allocated memory is still 197.1MB. Free memory was 159.2MB in the beginning and 122.5MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 45885.48ms. Allocated memory was 197.1MB in the beginning and 903.9MB in the end (delta: 706.7MB). Free memory was 121.4MB in the beginning and 459.3MB in the end (delta: -337.9MB). Peak memory consumption was 368.9MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 903.9MB. Free memory was 459.3MB in the beginning and 458.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 219, overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 142. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] float var_1_27 = 31.25; [L44] float var_1_28 = 2.95; [L45] signed char var_1_29 = 10; [L46] double var_1_30 = 0.5; [L47] unsigned char var_1_31 = 0; [L48] unsigned short int var_1_32 = 1; [L49] double var_1_33 = 3.2; [L50] unsigned char var_1_34 = 2; [L51] unsigned char var_1_35 = 4; [L52] signed long int var_1_36 = -256; [L53] unsigned short int var_1_37 = 64; [L54] unsigned short int var_1_38 = 57633; [L55] unsigned short int var_1_39 = 28505; [L56] signed short int var_1_40 = 64; [L57] signed char var_1_41 = -100; [L58] unsigned short int var_1_42 = 5; [L59] signed char var_1_43 = 100; [L60] unsigned short int last_1_var_1_6 = 4; [L61] unsigned short int last_1_var_1_9 = 4; [L62] unsigned long int last_1_var_1_14 = 500; [L63] signed short int last_1_var_1_17 = 16; [L223] isInitial = 1 [L224] FCALL initially() [L225] COND TRUE 1 [L226] CALL updateLastVariables() [L213] last_1_var_1_6 = var_1_6 [L214] last_1_var_1_9 = var_1_9 [L215] last_1_var_1_14 = var_1_14 [L216] last_1_var_1_17 = var_1_17 [L226] RET updateLastVariables() [L227] CALL updateVariables() [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_5=0, var_1_6=4, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] var_1_5 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L153] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_6=4, var_1_9=4] [L154] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] var_1_10 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L160] var_1_13 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L161] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L162] var_1_15 = __VERIFIER_nondet_ulong() [L163] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L163] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L164] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L165] var_1_16 = __VERIFIER_nondet_ulong() [L166] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L166] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L167] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L168] var_1_19 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L169] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L170] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] var_1_20 = __VERIFIER_nondet_short() [L172] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L172] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L173] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] var_1_21 = __VERIFIER_nondet_short() [L175] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L176] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L177] var_1_22 = __VERIFIER_nondet_short() [L178] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L178] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L179] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L180] var_1_24 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L181] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L182] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_27=125/4, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L183] var_1_27 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L184] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_28=59/20, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L185] var_1_28 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L186] RET assume_abort_if_not((var_1_28 >= -922337.2036854776000e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854776000e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=10, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L187] var_1_29 = __VERIFIER_nondet_char() [L188] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L188] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L189] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L190] var_1_31 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L191] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L192] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L193] var_1_32 = __VERIFIER_nondet_ushort() [L194] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L194] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] CALL assume_abort_if_not(var_1_32 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L195] RET assume_abort_if_not(var_1_32 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_33=16/5, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L196] var_1_33 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L197] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=4, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L198] var_1_35 = __VERIFIER_nondet_uchar() [L199] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L199] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L200] CALL assume_abort_if_not(var_1_35 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L200] RET assume_abort_if_not(var_1_35 <= 254) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=57633, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L201] var_1_38 = __VERIFIER_nondet_ushort() [L202] CALL assume_abort_if_not(var_1_38 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L202] RET assume_abort_if_not(var_1_38 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L203] CALL assume_abort_if_not(var_1_38 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L203] RET assume_abort_if_not(var_1_38 <= 65535) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=28505, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L204] var_1_39 = __VERIFIER_nondet_ushort() [L205] CALL assume_abort_if_not(var_1_39 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L205] RET assume_abort_if_not(var_1_39 >= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L206] CALL assume_abort_if_not(var_1_39 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L206] RET assume_abort_if_not(var_1_39 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-100, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L207] var_1_41 = __VERIFIER_nondet_char() [L208] CALL assume_abort_if_not(var_1_41 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L208] RET assume_abort_if_not(var_1_41 >= -128) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L209] CALL assume_abort_if_not(var_1_41 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L209] RET assume_abort_if_not(var_1_41 <= 127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] CALL assume_abort_if_not(var_1_41 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L210] RET assume_abort_if_not(var_1_41 != 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=0, var_1_25=-500, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L227] RET updateVariables() [L228] CALL step() [L67] var_1_23 = var_1_24 [L68] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=-2, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L69] COND TRUE (- var_1_27) >= var_1_28 [L70] var_1_26 = ((((var_1_24) > (var_1_29)) ? (var_1_24) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L72] COND FALSE !(\read(var_1_31)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND FALSE !(var_1_26 < var_1_24) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_34=2, var_1_35=0, var_1_36=-256, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L80] COND TRUE var_1_34 != ((((var_1_35) < 0 ) ? -(var_1_35) : (var_1_35))) [L81] var_1_36 = (((((var_1_34 - var_1_32)) < ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25))))) ? ((var_1_34 - var_1_32)) : ((((((var_1_24 + var_1_26)) < (var_1_25)) ? ((var_1_24 + var_1_26)) : (var_1_25)))))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=64, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L83] COND TRUE (var_1_25 * (var_1_38 - var_1_34)) <= var_1_23 [L84] var_1_37 = ((var_1_39 - var_1_35) + var_1_34) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] EXPR var_1_23 ^ (var_1_32 % var_1_41) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=64, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L90] COND FALSE !(var_1_24 >= (var_1_23 ^ (var_1_32 % var_1_41))) [L99] var_1_40 = var_1_34 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=5, var_1_43=100, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_42 = var_1_39 [L102] var_1_43 = var_1_24 [L103] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] COND TRUE last_1_var_1_14 >= stepLocal_3 [L111] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] COND TRUE (- var_1_14) > var_1_6 [L115] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] unsigned char stepLocal_2 = var_1_4; [L121] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=11811160046, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=11811160046, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] COND TRUE stepLocal_1 >= var_1_6 [L126] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L131] unsigned char stepLocal_5 = var_1_1; [L132] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L133] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] COND TRUE ! var_1_1 [L142] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L228] RET step() [L229] CALL, EXPR property() [L219-L220] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; [L229] RET, EXPR property() [L229] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=11811160046, var_1_15=2147483647, var_1_16=11811160062, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_29=0, var_1_30=1/2, var_1_31=0, var_1_32=1, var_1_34=2, var_1_35=0, var_1_36=0, var_1_37=16385, var_1_38=32767, var_1_39=16383, var_1_40=2, var_1_41=-2, var_1_42=16383, var_1_43=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 11, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3078 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3037 mSDsluCounter, 5684 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3646 mSDsCounter, 1372 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3526 IncrementalHoareTripleChecker+Invalid, 4898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1372 mSolverCounterUnsat, 2038 mSDtfsCounter, 3526 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2451 GetRequests, 2273 SyntacticMatches, 5 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4018 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=576occurred in iteration=9, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 617 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 33.2s InterpolantComputationTime, 3687 NumberOfCodeBlocks, 3687 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3915 ConstructedInterpolants, 0 QuantifiedInterpolants, 30411 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1698 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 16 InterpolantComputations, 7 PerfectInterpolantSequences, 48372/49920 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:12:57,768 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-11 10:12:57,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-cn_file-4.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 2a17d360b20bc2aef487820935da4493eeb86b5990f7bfc304c1b85cdc64ccf7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:12:59,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:12:59,795 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:12:59,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:12:59,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:12:59,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:12:59,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:12:59,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:12:59,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:12:59,831 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:12:59,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:12:59,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:12:59,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:12:59,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:12:59,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:12:59,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:12:59,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:12:59,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:12:59,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:12:59,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:12:59,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:12:59,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:12:59,834 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:12:59,835 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:12:59,835 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:12:59,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:12:59,835 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:12:59,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:12:59,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:12:59,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:12:59,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:12:59,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:12:59,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:12:59,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:12:59,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:12:59,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:12:59,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:12:59,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:12:59,838 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:12:59,838 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:12:59,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:12:59,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:12:59,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:12:59,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:12:59,839 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:12:59,839 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 -> 2a17d360b20bc2aef487820935da4493eeb86b5990f7bfc304c1b85cdc64ccf7 [2024-10-11 10:13:00,133 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:13:00,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:13:00,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:13:00,158 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:13:00,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:13:00,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:13:01,652 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:13:01,863 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:13:01,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:13:01,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c4b2b2b5/4cbee3fe7b6741baa233682b0bd9fe41/FLAG91dd5d599 [2024-10-11 10:13:01,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c4b2b2b5/4cbee3fe7b6741baa233682b0bd9fe41 [2024-10-11 10:13:01,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:13:01,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:13:01,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:13:01,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:13:01,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:13:01,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:13:01" (1/1) ... [2024-10-11 10:13:01,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b41963c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:01, skipping insertion in model container [2024-10-11 10:13:01,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:13:01" (1/1) ... [2024-10-11 10:13:01,929 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:13:02,078 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-cn_file-4.i[918,931] [2024-10-11 10:13:02,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:13:02,184 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:13:02,198 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-cn_file-4.i[918,931] [2024-10-11 10:13:02,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:13:02,272 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:13:02,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02 WrapperNode [2024-10-11 10:13:02,275 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:13:02,276 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:13:02,276 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:13:02,276 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:13:02,282 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:13:02" (1/1) ... [2024-10-11 10:13:02,301 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:13:02" (1/1) ... [2024-10-11 10:13:02,325 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 237 [2024-10-11 10:13:02,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:13:02,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:13:02,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:13:02,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:13:02,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,354 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:13:02,355 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,363 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:13:02,374 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:13:02,374 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:13:02,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:13:02,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (1/1) ... [2024-10-11 10:13:02,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:13:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:13:02,408 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:13:02,411 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:13:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:13:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:13:02,444 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:13:02,444 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:13:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:13:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:13:02,525 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:13:02,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:13:03,317 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 10:13:03,318 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:13:03,366 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:13:03,367 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:13:03,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:13:03 BoogieIcfgContainer [2024-10-11 10:13:03,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:13:03,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:13:03,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:13:03,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:13:03,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:13:01" (1/3) ... [2024-10-11 10:13:03,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f5f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:13:03, skipping insertion in model container [2024-10-11 10:13:03,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:13:02" (2/3) ... [2024-10-11 10:13:03,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e1f5f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:13:03, skipping insertion in model container [2024-10-11 10:13:03,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:13:03" (3/3) ... [2024-10-11 10:13:03,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-4.i [2024-10-11 10:13:03,394 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:13:03,394 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:13:03,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:13:03,474 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;@3df16307, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:13:03,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:13:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:13:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-10-11 10:13:03,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:03,503 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:03,503 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:03,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash -754074193, now seen corresponding path program 1 times [2024-10-11 10:13:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:03,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534502106] [2024-10-11 10:13:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:03,525 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:13:03,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:03,528 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:13:03,529 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:13:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:03,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:13:03,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1310 proven. 0 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-10-11 10:13:04,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:13:04,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:04,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534502106] [2024-10-11 10:13:04,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534502106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:13:04,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:13:04,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:13:04,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676194923] [2024-10-11 10:13:04,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:13:04,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:13:04,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:04,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:13:04,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:13:04,041 INFO L87 Difference]: Start difference. First operand has 101 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:13:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:04,264 INFO L93 Difference]: Finished difference Result 199 states and 368 transitions. [2024-10-11 10:13:04,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:13:04,277 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 243 [2024-10-11 10:13:04,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:04,283 INFO L225 Difference]: With dead ends: 199 [2024-10-11 10:13:04,283 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 10:13:04,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 242 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:13:04,289 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 156 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:04,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:13:04,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 10:13:04,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 10:13:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 57 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 10:13:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 159 transitions. [2024-10-11 10:13:04,329 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 159 transitions. Word has length 243 [2024-10-11 10:13:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:04,329 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 159 transitions. [2024-10-11 10:13:04,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-10-11 10:13:04,329 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 159 transitions. [2024-10-11 10:13:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 10:13:04,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:04,333 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:04,349 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:13:04,533 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:13:04,534 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:04,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash -433499807, now seen corresponding path program 1 times [2024-10-11 10:13:04,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:04,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134869703] [2024-10-11 10:13:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:04,536 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:13:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:04,538 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:13:04,540 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:13:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:04,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:13:04,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:13:04,991 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:13:04,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:04,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134869703] [2024-10-11 10:13:04,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134869703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:13:04,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:13:04,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:13:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123227125] [2024-10-11 10:13:04,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:13:04,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:13:04,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:13:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:13:04,996 INFO L87 Difference]: Start difference. First operand 99 states and 159 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:05,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:05,257 INFO L93 Difference]: Finished difference Result 278 states and 445 transitions. [2024-10-11 10:13:05,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:13:05,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 244 [2024-10-11 10:13:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:05,260 INFO L225 Difference]: With dead ends: 278 [2024-10-11 10:13:05,261 INFO L226 Difference]: Without dead ends: 180 [2024-10-11 10:13:05,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 242 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:13:05,262 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 126 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:05,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:13:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-11 10:13:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2024-10-11 10:13:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 104 states have internal predecessors, (142), 71 states have call successors, (71), 2 states have call predecessors, (71), 2 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 10:13:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 284 transitions. [2024-10-11 10:13:05,283 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 284 transitions. Word has length 244 [2024-10-11 10:13:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 284 transitions. [2024-10-11 10:13:05,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 284 transitions. [2024-10-11 10:13:05,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-10-11 10:13:05,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:05,287 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:05,298 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 (3)] Ended with exit code 0 [2024-10-11 10:13:05,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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:13:05,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:05,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2021847709, now seen corresponding path program 1 times [2024-10-11 10:13:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773519341] [2024-10-11 10:13:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:05,510 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:13:05,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:05,513 INFO L229 MonitoredProcess]: Starting monitored process 4 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:13:05,515 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 (4)] Waiting until timeout for monitored process [2024-10-11 10:13:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:05,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 10:13:05,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:06,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 379 proven. 219 refuted. 0 times theorem prover too weak. 2522 trivial. 0 not checked. [2024-10-11 10:13:06,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:13:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 9 proven. 222 refuted. 0 times theorem prover too weak. 2889 trivial. 0 not checked. [2024-10-11 10:13:07,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:07,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773519341] [2024-10-11 10:13:07,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773519341] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:13:07,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:13:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-10-11 10:13:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145984195] [2024-10-11 10:13:07,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:13:07,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 10:13:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:07,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 10:13:07,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:13:07,476 INFO L87 Difference]: Start difference. First operand 177 states and 284 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 10:13:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:09,293 INFO L93 Difference]: Finished difference Result 399 states and 612 transitions. [2024-10-11 10:13:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 10:13:09,294 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 244 [2024-10-11 10:13:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:09,300 INFO L225 Difference]: With dead ends: 399 [2024-10-11 10:13:09,300 INFO L226 Difference]: Without dead ends: 223 [2024-10-11 10:13:09,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 473 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-10-11 10:13:09,303 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 90 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:09,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 478 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 10:13:09,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-10-11 10:13:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 201. [2024-10-11 10:13:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 123 states have (on average 1.2520325203252032) internal successors, (154), 124 states have internal predecessors, (154), 71 states have call successors, (71), 6 states have call predecessors, (71), 6 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 10:13:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 296 transitions. [2024-10-11 10:13:09,326 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 296 transitions. Word has length 244 [2024-10-11 10:13:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:09,327 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 296 transitions. [2024-10-11 10:13:09,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (78), 3 states have call predecessors, (78), 7 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2024-10-11 10:13:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 296 transitions. [2024-10-11 10:13:09,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:13:09,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:09,330 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:09,347 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 (4)] Ended with exit code 0 [2024-10-11 10:13:09,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:13:09,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:09,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:09,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1252475756, now seen corresponding path program 1 times [2024-10-11 10:13:09,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:09,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [942860364] [2024-10-11 10:13:09,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:09,536 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:13:09,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:09,540 INFO L229 MonitoredProcess]: Starting monitored process 5 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:13:09,541 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 (5)] Waiting until timeout for monitored process [2024-10-11 10:13:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:09,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:13:09,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:10,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 193 proven. 114 refuted. 0 times theorem prover too weak. 2813 trivial. 0 not checked. [2024-10-11 10:13:10,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:13:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 3 proven. 114 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2024-10-11 10:13:11,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [942860364] [2024-10-11 10:13:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [942860364] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:13:11,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:13:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2024-10-11 10:13:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471042859] [2024-10-11 10:13:11,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:13:11,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:13:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:11,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:13:11,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:13:11,389 INFO L87 Difference]: Start difference. First operand 201 states and 296 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-10-11 10:13:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:12,770 INFO L93 Difference]: Finished difference Result 429 states and 620 transitions. [2024-10-11 10:13:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 10:13:12,783 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) Word has length 245 [2024-10-11 10:13:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:12,785 INFO L225 Difference]: With dead ends: 429 [2024-10-11 10:13:12,785 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 10:13:12,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 480 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-11 10:13:12,793 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 55 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:12,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 323 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 10:13:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 10:13:12,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 189. [2024-10-11 10:13:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 111 states have (on average 1.2432432432432432) internal successors, (138), 112 states have internal predecessors, (138), 71 states have call successors, (71), 6 states have call predecessors, (71), 6 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-10-11 10:13:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 280 transitions. [2024-10-11 10:13:12,844 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 280 transitions. Word has length 245 [2024-10-11 10:13:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:12,852 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 280 transitions. [2024-10-11 10:13:12,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (80), 3 states have call predecessors, (80), 5 states have return successors, (80), 2 states have call predecessors, (80), 2 states have call successors, (80) [2024-10-11 10:13:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 280 transitions. [2024-10-11 10:13:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:13:12,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:12,857 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:12,868 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 (5)] Ended with exit code 0 [2024-10-11 10:13:13,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:13:13,058 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:13,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1544080975, now seen corresponding path program 1 times [2024-10-11 10:13:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:13,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519687913] [2024-10-11 10:13:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:13,060 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:13:13,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:13,063 INFO L229 MonitoredProcess]: Starting monitored process 6 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:13:13,064 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 (6)] Waiting until timeout for monitored process [2024-10-11 10:13:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:13,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:13:13,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:13,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:13:13,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:13:13,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:13,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519687913] [2024-10-11 10:13:13,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519687913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:13:13,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:13:13,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:13:13,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609474732] [2024-10-11 10:13:13,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:13:13,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:13:13,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:13,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:13:13,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:13:13,687 INFO L87 Difference]: Start difference. First operand 189 states and 280 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:14,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:14,411 INFO L93 Difference]: Finished difference Result 563 states and 834 transitions. [2024-10-11 10:13:14,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:13:14,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:13:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:14,418 INFO L225 Difference]: With dead ends: 563 [2024-10-11 10:13:14,424 INFO L226 Difference]: Without dead ends: 375 [2024-10-11 10:13:14,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:13:14,427 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 177 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:14,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 441 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:13:14,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-11 10:13:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2024-10-11 10:13:14,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 218 states have (on average 1.2201834862385321) internal successors, (266), 220 states have internal predecessors, (266), 142 states have call successors, (142), 12 states have call predecessors, (142), 12 states have return successors, (142), 140 states have call predecessors, (142), 142 states have call successors, (142) [2024-10-11 10:13:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 550 transitions. [2024-10-11 10:13:14,523 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 550 transitions. Word has length 245 [2024-10-11 10:13:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:14,523 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 550 transitions. [2024-10-11 10:13:14,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 550 transitions. [2024-10-11 10:13:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:13:14,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:14,526 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:14,537 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 (6)] Ended with exit code 0 [2024-10-11 10:13:14,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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:13:14,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:14,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:14,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1941539695, now seen corresponding path program 1 times [2024-10-11 10:13:14,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:14,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438468158] [2024-10-11 10:13:14,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:14,729 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:13:14,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:14,730 INFO L229 MonitoredProcess]: Starting monitored process 7 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:13:14,732 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 (7)] Waiting until timeout for monitored process [2024-10-11 10:13:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:14,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 10:13:15,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:16,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1047 proven. 93 refuted. 0 times theorem prover too weak. 1980 trivial. 0 not checked. [2024-10-11 10:13:16,386 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:13:16,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438468158] [2024-10-11 10:13:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438468158] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:13:16,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [445525894] [2024-10-11 10:13:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:16,595 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:13:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:13:16,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:13:16,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-10-11 10:13:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:17,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 10:13:17,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:19,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1198 proven. 177 refuted. 0 times theorem prover too weak. 1745 trivial. 0 not checked. [2024-10-11 10:13:19,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:13:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [445525894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:13:19,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:13:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-10-11 10:13:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089457800] [2024-10-11 10:13:19,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:13:19,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 10:13:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 10:13:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-10-11 10:13:19,657 INFO L87 Difference]: Start difference. First operand 373 states and 550 transitions. Second operand has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-10-11 10:13:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:23,730 INFO L93 Difference]: Finished difference Result 1017 states and 1450 transitions. [2024-10-11 10:13:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 10:13:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 245 [2024-10-11 10:13:23,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:23,739 INFO L225 Difference]: With dead ends: 1017 [2024-10-11 10:13:23,739 INFO L226 Difference]: Without dead ends: 645 [2024-10-11 10:13:23,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 515 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 10:13:23,742 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 386 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:23,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 708 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 10:13:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2024-10-11 10:13:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 607. [2024-10-11 10:13:23,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 363 states have (on average 1.1955922865013775) internal successors, (434), 366 states have internal predecessors, (434), 213 states have call successors, (213), 30 states have call predecessors, (213), 30 states have return successors, (213), 210 states have call predecessors, (213), 213 states have call successors, (213) [2024-10-11 10:13:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 860 transitions. [2024-10-11 10:13:23,822 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 860 transitions. Word has length 245 [2024-10-11 10:13:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:23,839 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 860 transitions. [2024-10-11 10:13:23,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.117647058823529) internal successors, (104), 16 states have internal predecessors, (104), 5 states have call successors, (80), 5 states have call predecessors, (80), 8 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2024-10-11 10:13:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 860 transitions. [2024-10-11 10:13:23,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-10-11 10:13:23,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:23,841 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,854 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 (7)] Ended with exit code 0 [2024-10-11 10:13:24,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-10-11 10:13:24,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 10:13:24,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash -2095262163, now seen corresponding path program 1 times [2024-10-11 10:13:24,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:24,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709626118] [2024-10-11 10:13:24,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:13:24,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:24,254 INFO L229 MonitoredProcess]: Starting monitored process 9 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:13:24,255 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 (9)] Waiting until timeout for monitored process [2024-10-11 10:13:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:24,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:13:24,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:13:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-10-11 10:13:25,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:13:25,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:13:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709626118] [2024-10-11 10:13:25,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709626118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:13:25,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:13:25,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:13:25,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364621092] [2024-10-11 10:13:25,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:13:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:13:25,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:13:25,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:13:25,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:13:25,265 INFO L87 Difference]: Start difference. First operand 607 states and 860 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:13:26,170 INFO L93 Difference]: Finished difference Result 948 states and 1341 transitions. [2024-10-11 10:13:26,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:13:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 245 [2024-10-11 10:13:26,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:13:26,184 INFO L225 Difference]: With dead ends: 948 [2024-10-11 10:13:26,184 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 10:13:26,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:13:26,186 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 84 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:13:26,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 485 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 10:13:26,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 10:13:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 314. [2024-10-11 10:13:26,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 187 states have (on average 1.213903743315508) internal successors, (227), 188 states have internal predecessors, (227), 111 states have call successors, (111), 15 states have call predecessors, (111), 15 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-10-11 10:13:26,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 449 transitions. [2024-10-11 10:13:26,223 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 449 transitions. Word has length 245 [2024-10-11 10:13:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:13:26,223 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 449 transitions. [2024-10-11 10:13:26,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-10-11 10:13:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 449 transitions. [2024-10-11 10:13:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-10-11 10:13:26,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:13:26,225 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:26,236 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 (9)] Ended with exit code 0 [2024-10-11 10:13:26,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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:13:26,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:13:26,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:13:26,431 INFO L85 PathProgramCache]: Analyzing trace with hash 474634054, now seen corresponding path program 1 times [2024-10-11 10:13:26,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:13:26,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27665809] [2024-10-11 10:13:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:13:26,432 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:13:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:13:26,436 INFO L229 MonitoredProcess]: Starting monitored process 10 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:13:26,437 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 (10)] Waiting until timeout for monitored process [2024-10-11 10:13:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:13:26,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 10:13:26,690 INFO L278 TraceCheckSpWp]: Computing forward predicates...