./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-pe-cn_file-74.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-pe-cn_file-74.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 2aaa7dce49feba020883f6aaf5baeb03a6b852994db09df009087846bd7de8c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:10:44,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:10:44,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:10:44,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:10:44,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:10:45,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:10:45,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:10:45,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:10:45,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:10:45,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:10:45,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:10:45,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:10:45,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:10:45,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:10:45,028 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:10:45,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:10:45,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:10:45,029 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:10:45,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:10:45,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:10:45,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:10:45,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:10:45,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:10:45,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:10:45,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:10:45,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:10:45,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:10:45,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:10:45,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:10:45,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:10:45,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:10:45,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:10:45,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:10:45,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:10:45,036 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:10:45,036 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:10:45,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:10:45,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:10:45,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:10:45,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:10:45,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:10:45,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:10:45,038 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 -> 2aaa7dce49feba020883f6aaf5baeb03a6b852994db09df009087846bd7de8c1 [2024-10-11 09:10:45,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:10:45,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:10:45,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:10:45,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:10:45,292 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:10:45,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:10:46,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:10:46,819 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:10:46,820 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:10:46,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27331295a/7152e3d25f9b48fd89062118ae153de2/FLAGe5026fe29 [2024-10-11 09:10:46,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/27331295a/7152e3d25f9b48fd89062118ae153de2 [2024-10-11 09:10:46,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:10:46,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:10:46,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:10:46,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:10:46,850 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:10:46,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:46" (1/1) ... [2024-10-11 09:10:46,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5752b99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:46, skipping insertion in model container [2024-10-11 09:10:46,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:10:46" (1/1) ... [2024-10-11 09:10:46,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:10:47,026 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-pe-cn_file-74.i[919,932] [2024-10-11 09:10:47,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:10:47,098 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:10:47,121 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-pe-cn_file-74.i[919,932] [2024-10-11 09:10:47,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:10:47,189 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:10:47,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47 WrapperNode [2024-10-11 09:10:47,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:10:47,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:10:47,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:10:47,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:10:47,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,248 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-10-11 09:10:47,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:10:47,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:10:47,252 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:10:47,252 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:10:47,267 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,302 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 09:10:47,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:10:47,336 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:10:47,336 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:10:47,336 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:10:47,337 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (1/1) ... [2024-10-11 09:10:47,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:10:47,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:10:47,362 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 09:10:47,364 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 09:10:47,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:10:47,402 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:10:47,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:10:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:10:47,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:10:47,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:10:47,490 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:10:47,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:10:48,001 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 09:10:48,003 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:10:48,041 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:10:48,042 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:10:48,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:48 BoogieIcfgContainer [2024-10-11 09:10:48,043 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:10:48,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:10:48,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:10:48,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:10:48,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:10:46" (1/3) ... [2024-10-11 09:10:48,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5161d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:48, skipping insertion in model container [2024-10-11 09:10:48,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:10:47" (2/3) ... [2024-10-11 09:10:48,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5161d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:10:48, skipping insertion in model container [2024-10-11 09:10:48,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:48" (3/3) ... [2024-10-11 09:10:48,051 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:10:48,067 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:10:48,067 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:10:48,128 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:10:48,134 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;@4449bc4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:10:48,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:10:48,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:10:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:10:48,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:48,151 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:48,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:48,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash 950744390, now seen corresponding path program 1 times [2024-10-11 09:10:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793777538] [2024-10-11 09:10:48,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:48,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:48,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:48,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793777538] [2024-10-11 09:10:48,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793777538] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:48,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:48,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:10:48,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705465476] [2024-10-11 09:10:48,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:48,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:10:48,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:10:48,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:10:48,747 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.48) internal successors, (111), 76 states have internal predecessors, (111), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:10:48,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:48,792 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2024-10-11 09:10:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:10:48,794 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 228 [2024-10-11 09:10:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:48,804 INFO L225 Difference]: With dead ends: 224 [2024-10-11 09:10:48,804 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 09:10:48,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:10:48,810 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:48,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:10:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 09:10:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-11 09:10:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:10:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 172 transitions. [2024-10-11 09:10:48,860 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 172 transitions. Word has length 228 [2024-10-11 09:10:48,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:48,860 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 172 transitions. [2024-10-11 09:10:48,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:10:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 172 transitions. [2024-10-11 09:10:48,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:10:48,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:48,869 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:48,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:10:48,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:48,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:48,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1553298292, now seen corresponding path program 1 times [2024-10-11 09:10:48,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:48,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449897802] [2024-10-11 09:10:48,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:48,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:49,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:49,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:49,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:49,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:49,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:49,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449897802] [2024-10-11 09:10:49,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449897802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:49,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:49,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:10:49,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20113818] [2024-10-11 09:10:49,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:49,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:10:49,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:10:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:10:49,243 INFO L87 Difference]: Start difference. First operand 111 states and 172 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:49,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:49,310 INFO L93 Difference]: Finished difference Result 273 states and 420 transitions. [2024-10-11 09:10:49,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:10:49,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-11 09:10:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:49,315 INFO L225 Difference]: With dead ends: 273 [2024-10-11 09:10:49,315 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 09:10:49,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:10:49,317 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 75 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:49,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 328 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:10:49,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 09:10:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-10-11 09:10:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3982300884955752) internal successors, (158), 114 states have internal predecessors, (158), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 09:10:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 246 transitions. [2024-10-11 09:10:49,340 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 246 transitions. Word has length 228 [2024-10-11 09:10:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:49,341 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 246 transitions. [2024-10-11 09:10:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:49,341 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 246 transitions. [2024-10-11 09:10:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:10:49,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:49,344 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:49,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:10:49,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:49,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:49,345 INFO L85 PathProgramCache]: Analyzing trace with hash -35049610, now seen corresponding path program 1 times [2024-10-11 09:10:49,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:49,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406444537] [2024-10-11 09:10:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:49,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:49,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:49,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:49,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406444537] [2024-10-11 09:10:49,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406444537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:49,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:49,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:10:49,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801414786] [2024-10-11 09:10:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:49,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:10:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:10:49,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:10:49,721 INFO L87 Difference]: Start difference. First operand 160 states and 246 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:49,775 INFO L93 Difference]: Finished difference Result 319 states and 491 transitions. [2024-10-11 09:10:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:10:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 228 [2024-10-11 09:10:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:49,781 INFO L225 Difference]: With dead ends: 319 [2024-10-11 09:10:49,782 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 09:10:49,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:10:49,784 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:49,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 157 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:10:49,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 09:10:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-11 09:10:49,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3628318584070795) internal successors, (154), 114 states have internal predecessors, (154), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-11 09:10:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2024-10-11 09:10:49,813 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 228 [2024-10-11 09:10:49,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:49,815 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2024-10-11 09:10:49,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2024-10-11 09:10:49,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 09:10:49,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:49,820 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:49,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:10:49,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:49,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:49,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2042684109, now seen corresponding path program 1 times [2024-10-11 09:10:49,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:49,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233515157] [2024-10-11 09:10:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:49,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:50,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:50,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233515157] [2024-10-11 09:10:50,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233515157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:50,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:50,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:10:50,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165944412] [2024-10-11 09:10:50,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:50,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:10:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:10:50,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:10:50,645 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:50,974 INFO L93 Difference]: Finished difference Result 468 states and 706 transitions. [2024-10-11 09:10:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:10:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 230 [2024-10-11 09:10:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:50,977 INFO L225 Difference]: With dead ends: 468 [2024-10-11 09:10:50,978 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 09:10:50,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:10:50,980 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 110 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:50,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 566 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:10:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 09:10:51,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 228. [2024-10-11 09:10:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 144 states have internal predecessors, (184), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:10:51,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-11 09:10:51,024 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 230 [2024-10-11 09:10:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:51,026 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-11 09:10:51,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-11 09:10:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:10:51,028 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:51,028 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:51,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:10:51,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash 496064251, now seen corresponding path program 1 times [2024-10-11 09:10:51,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38884172] [2024-10-11 09:10:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:51,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38884172] [2024-10-11 09:10:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38884172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:10:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751840468] [2024-10-11 09:10:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:51,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:10:51,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:51,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:10:51,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:10:51,509 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:51,783 INFO L93 Difference]: Finished difference Result 468 states and 705 transitions. [2024-10-11 09:10:51,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:10:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-10-11 09:10:51,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:51,787 INFO L225 Difference]: With dead ends: 468 [2024-10-11 09:10:51,787 INFO L226 Difference]: Without dead ends: 309 [2024-10-11 09:10:51,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 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 09:10:51,789 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 108 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:51,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 567 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:10:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-11 09:10:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 229. [2024-10-11 09:10:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 145 states have internal predecessors, (185), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:10:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2024-10-11 09:10:51,825 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 231 [2024-10-11 09:10:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:51,828 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2024-10-11 09:10:51,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2024-10-11 09:10:51,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-10-11 09:10:51,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:51,831 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:51,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:10:51,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:51,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:51,832 INFO L85 PathProgramCache]: Analyzing trace with hash 558103865, now seen corresponding path program 1 times [2024-10-11 09:10:51,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866585809] [2024-10-11 09:10:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:10:52,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:52,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866585809] [2024-10-11 09:10:52,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866585809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:10:52,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:10:52,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:10:52,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693852526] [2024-10-11 09:10:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:10:52,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:10:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:52,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:10:52,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:10:52,292 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:52,531 INFO L93 Difference]: Finished difference Result 395 states and 597 transitions. [2024-10-11 09:10:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:10:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2024-10-11 09:10:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:52,533 INFO L225 Difference]: With dead ends: 395 [2024-10-11 09:10:52,534 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 09:10:52,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 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 09:10:52,536 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 148 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:52,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 558 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:10:52,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 09:10:52,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2024-10-11 09:10:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 144 states have (on average 1.2708333333333333) internal successors, (183), 145 states have internal predecessors, (183), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:10:52,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 343 transitions. [2024-10-11 09:10:52,573 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 343 transitions. Word has length 231 [2024-10-11 09:10:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:52,574 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 343 transitions. [2024-10-11 09:10:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:10:52,574 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 343 transitions. [2024-10-11 09:10:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-10-11 09:10:52,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:52,576 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:52,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:10:52,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1119701528, now seen corresponding path program 1 times [2024-10-11 09:10:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578080532] [2024-10-11 09:10:52,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:52,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:10:52,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:52,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578080532] [2024-10-11 09:10:52,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578080532] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:10:52,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564089018] [2024-10-11 09:10:52,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:52,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:52,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:10:52,825 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 09:10:52,826 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 09:10:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:52,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 09:10:52,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:10:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1139 proven. 33 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-10-11 09:10:53,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:10:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 72 proven. 33 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:10:53,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564089018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:10:53,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:10:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 09:10:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994873856] [2024-10-11 09:10:53,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:10:53,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:10:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:10:53,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:10:53,419 INFO L87 Difference]: Start difference. First operand 229 states and 343 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-11 09:10:53,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:53,669 INFO L93 Difference]: Finished difference Result 404 states and 596 transitions. [2024-10-11 09:10:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:10:53,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 233 [2024-10-11 09:10:53,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:53,672 INFO L225 Difference]: With dead ends: 404 [2024-10-11 09:10:53,672 INFO L226 Difference]: Without dead ends: 245 [2024-10-11 09:10:53,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:10:53,673 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 91 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:53,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 352 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:10:53,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-10-11 09:10:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 237. [2024-10-11 09:10:53,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 151 states have internal predecessors, (187), 80 states have call successors, (80), 6 states have call predecessors, (80), 6 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:10:53,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 347 transitions. [2024-10-11 09:10:53,705 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 347 transitions. Word has length 233 [2024-10-11 09:10:53,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:53,706 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 347 transitions. [2024-10-11 09:10:53,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 3 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-10-11 09:10:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 347 transitions. [2024-10-11 09:10:53,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 09:10:53,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:53,709 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:53,730 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 09:10:53,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:53,910 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:53,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:53,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1378802673, now seen corresponding path program 1 times [2024-10-11 09:10:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:53,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462577327] [2024-10-11 09:10:53,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:10:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:10:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:10:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:10:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:10:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:10:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:10:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:10:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:10:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:10:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:10:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:10:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:10:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:10:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:10:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:10:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:10:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:10:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:10:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:10:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 09:10:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:10:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:10:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:10:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:10:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:10:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:10:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 09:10:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 09:10:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 09:10:54,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 09:10:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 09:10:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 09:10:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 09:10:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 09:10:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-10-11 09:10:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 36 proven. 69 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:10:54,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:10:54,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462577327] [2024-10-11 09:10:54,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462577327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:10:54,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845137046] [2024-10-11 09:10:54,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:54,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:54,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:10:54,519 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 09:10:54,520 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 09:10:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:10:54,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 09:10:54,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:10:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1065 proven. 75 refuted. 0 times theorem prover too weak. 1380 trivial. 0 not checked. [2024-10-11 09:10:55,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:10:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:10:56,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845137046] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:10:56,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:10:56,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2024-10-11 09:10:56,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039342158] [2024-10-11 09:10:56,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:10:56,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 09:10:56,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:10:56,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 09:10:56,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2024-10-11 09:10:56,995 INFO L87 Difference]: Start difference. First operand 237 states and 347 transitions. Second operand has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 7 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (88), 4 states have call predecessors, (88), 7 states have call successors, (88) [2024-10-11 09:10:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:10:58,396 INFO L93 Difference]: Finished difference Result 541 states and 769 transitions. [2024-10-11 09:10:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 09:10:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 7 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (88), 4 states have call predecessors, (88), 7 states have call successors, (88) Word has length 237 [2024-10-11 09:10:58,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:10:58,398 INFO L225 Difference]: With dead ends: 541 [2024-10-11 09:10:58,398 INFO L226 Difference]: Without dead ends: 378 [2024-10-11 09:10:58,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 580 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=573, Invalid=1497, Unknown=0, NotChecked=0, Total=2070 [2024-10-11 09:10:58,400 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 503 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 09:10:58,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 691 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 09:10:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-10-11 09:10:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 257. [2024-10-11 09:10:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 165 states have (on average 1.2121212121212122) internal successors, (200), 166 states have internal predecessors, (200), 80 states have call successors, (80), 11 states have call predecessors, (80), 11 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:10:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 360 transitions. [2024-10-11 09:10:58,446 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 360 transitions. Word has length 237 [2024-10-11 09:10:58,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:10:58,446 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 360 transitions. [2024-10-11 09:10:58,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 7 states have call successors, (88), 3 states have call predecessors, (88), 5 states have return successors, (88), 4 states have call predecessors, (88), 7 states have call successors, (88) [2024-10-11 09:10:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 360 transitions. [2024-10-11 09:10:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-11 09:10:58,448 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:10:58,448 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:58,469 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 09:10:58,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:58,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:10:58,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:10:58,654 INFO L85 PathProgramCache]: Analyzing trace with hash -426635661, now seen corresponding path program 1 times [2024-10-11 09:10:58,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:10:58,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118857311] [2024-10-11 09:10:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:58,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:10:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:10:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [747585967] [2024-10-11 09:10:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:10:58,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:58,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:10:58,751 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 09:10:58,752 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 09:10:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:10:58,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:10:58,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:10:59,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:10:59,075 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:10:59,075 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:10:59,096 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 09:10:59,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:10:59,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:10:59,407 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:10:59,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:10:59 BoogieIcfgContainer [2024-10-11 09:10:59,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:10:59,411 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:10:59,411 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:10:59,411 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:10:59,412 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:10:48" (3/4) ... [2024-10-11 09:10:59,413 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:10:59,414 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:10:59,414 INFO L158 Benchmark]: Toolchain (without parser) took 12570.88ms. Allocated memory was 172.0MB in the beginning and 404.8MB in the end (delta: 232.8MB). Free memory was 98.2MB in the beginning and 223.2MB in the end (delta: -125.0MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,415 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 172.0MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:10:59,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.64ms. Allocated memory is still 172.0MB. Free memory was 97.9MB in the beginning and 141.2MB in the end (delta: -43.3MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,415 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.69ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,415 INFO L158 Benchmark]: Boogie Preprocessor took 83.39ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 132.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,415 INFO L158 Benchmark]: RCFGBuilder took 707.09ms. Allocated memory is still 172.0MB. Free memory was 132.8MB in the beginning and 99.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,416 INFO L158 Benchmark]: TraceAbstraction took 11366.26ms. Allocated memory was 172.0MB in the beginning and 404.8MB in the end (delta: 232.8MB). Free memory was 98.2MB in the beginning and 223.2MB in the end (delta: -125.0MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. [2024-10-11 09:10:59,416 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 404.8MB. Free memory is still 223.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:10:59,417 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 172.0MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.64ms. Allocated memory is still 172.0MB. Free memory was 97.9MB in the beginning and 141.2MB in the end (delta: -43.3MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.69ms. Allocated memory is still 172.0MB. Free memory was 141.2MB in the beginning and 137.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.39ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 132.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 707.09ms. Allocated memory is still 172.0MB. Free memory was 132.8MB in the beginning and 99.3MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11366.26ms. Allocated memory was 172.0MB in the beginning and 404.8MB in the end (delta: 232.8MB). Free memory was 98.2MB in the beginning and 223.2MB in the end (delta: -125.0MB). Peak memory consumption was 106.7MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 404.8MB. Free memory is still 223.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 208, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 208, overapproximation of someBinaryArithmeticFLOAToperation at line 101. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] unsigned long int var_1_26 = 2; [L44] signed char var_1_27 = 4; [L45] float var_1_28 = 3.5; [L46] signed short int var_1_29 = -8; [L47] signed short int var_1_30 = 256; [L48] signed char var_1_31 = -32; [L49] signed char var_1_32 = 2; [L50] unsigned char var_1_33 = 0; [L51] signed long int var_1_34 = -4; [L52] unsigned char var_1_35 = 1; [L53] unsigned char var_1_36 = 1; [L54] float var_1_37 = 32.2; [L55] double var_1_38 = 0.5; [L56] double var_1_39 = 255.8; [L57] unsigned long int last_1_var_1_1 = 64; [L58] unsigned char last_1_var_1_11 = 50; [L212] isInitial = 1 [L213] FCALL initially() [L214] COND TRUE 1 [L215] CALL updateLastVariables() [L204] last_1_var_1_1 = var_1_1 [L205] last_1_var_1_11 = var_1_11 [L215] RET updateLastVariables() [L216] CALL updateVariables() [L144] var_1_4 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L147] var_1_5 = __VERIFIER_nondet_ulong() [L148] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L150] var_1_7 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] var_1_9 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L154] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] var_1_12 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_13 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] var_1_16 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_17 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_19 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L172] var_1_20 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L173] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L174] var_1_21 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L175] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L176] var_1_22 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L177] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] var_1_23 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L179] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_26=2, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L180] var_1_26 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L181] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L182] CALL assume_abort_if_not(var_1_26 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_26 <= 4294967295) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=4, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L183] var_1_27 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L184] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L185] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=256, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L186] var_1_30 = __VERIFIER_nondet_short() [L187] CALL assume_abort_if_not(var_1_30 >= -32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187] RET assume_abort_if_not(var_1_30 >= -32766) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L188] CALL assume_abort_if_not(var_1_30 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L188] RET assume_abort_if_not(var_1_30 <= 32766) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L189] var_1_33 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L190] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L191] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L191] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=1, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L192] var_1_35 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L193] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L194] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L194] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=1, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L195] var_1_36 = __VERIFIER_nondet_uchar() [L196] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L196] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L197] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L197] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_37=161/5, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L198] var_1_37 = __VERIFIER_nondet_float() [L199] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L199] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_39=1279/5, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L200] var_1_39 = __VERIFIER_nondet_double() [L201] CALL assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L201] RET assume_abort_if_not((var_1_39 >= -922337.2036854765600e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854765600e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L216] RET updateVariables() [L217] CALL step() [L62] signed long int stepLocal_1 = last_1_var_1_11; [L63] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L64] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L65] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L69] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L70] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L70] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L71] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L82] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L84] COND FALSE !(! (var_1_11 >= var_1_11)) [L91] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L93] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L98] COND FALSE !(\read(var_1_10)) [L101] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L103] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L104] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L107] COND FALSE !((~ (var_1_26 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] COND FALSE !(var_1_25 > var_1_26) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=-8, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L113] COND TRUE (~ (5 + var_1_26)) >= 10000u [L114] var_1_29 = (((((var_1_25 + var_1_27)) > (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))))) ? ((var_1_25 + var_1_27)) : (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L118] var_1_31 = var_1_27 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] EXPR var_1_25 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] EXPR ((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] EXPR var_1_25 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] EXPR ((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L119] COND FALSE !(var_1_30 <= ((((var_1_27) < ((var_1_25 | -5))) ? (var_1_27) : ((var_1_25 | -5))))) [L124] COND TRUE ((((var_1_31) < (var_1_27)) ? (var_1_31) : (var_1_27))) <= var_1_30 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L125] COND FALSE !(\read(var_1_33)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L141] var_1_38 = var_1_39 [L217] RET step() [L218] CALL, EXPR property() [L208] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L208-L209] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L218] RET, EXPR property() [L218] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=-255, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_26=4294967291, var_1_27=0, var_1_28=7/2, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=2, var_1_33=0, var_1_34=-4, var_1_35=0, var_1_36=0, var_1_38=2, var_1_39=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 9, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1155 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1131 mSDsluCounter, 3387 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2061 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1687 IncrementalHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 1326 mSDtfsCounter, 1687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1622 GetRequests, 1551 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=257occurred in iteration=8, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 300 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 2790 NumberOfCodeBlocks, 2790 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2774 ConstructedInterpolants, 0 QuantifiedInterpolants, 8118 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1035 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 29922/30240 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 09:10:59,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.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 2aaa7dce49feba020883f6aaf5baeb03a6b852994db09df009087846bd7de8c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:11:01,528 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:11:01,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:11:01,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:11:01,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:11:01,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:11:01,630 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:11:01,630 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:11:01,630 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:11:01,630 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:11:01,631 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:11:01,631 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:11:01,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:11:01,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:11:01,632 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:11:01,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:11:01,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:11:01,635 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:11:01,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:11:01,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:11:01,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:11:01,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:11:01,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:11:01,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:11:01,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:11:01,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:11:01,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:11:01,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:11:01,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:11:01,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:11:01,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:11:01,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:11:01,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:11:01,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:11:01,643 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:11:01,643 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 -> 2aaa7dce49feba020883f6aaf5baeb03a6b852994db09df009087846bd7de8c1 [2024-10-11 09:11:01,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:11:01,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:11:01,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:11:01,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:11:01,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:11:01,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:11:03,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:11:03,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:11:03,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:11:03,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a0d00416/04fbf9095a5d453a862564118ab826af/FLAG9026e5311 [2024-10-11 09:11:03,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2a0d00416/04fbf9095a5d453a862564118ab826af [2024-10-11 09:11:03,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:11:03,554 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:11:03,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:11:03,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:11:03,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:11:03,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bb6ca3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03, skipping insertion in model container [2024-10-11 09:11:03,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:11:03,744 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-pe-cn_file-74.i[919,932] [2024-10-11 09:11:03,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:11:03,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:11:03,846 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-pe-cn_file-74.i[919,932] [2024-10-11 09:11:03,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:11:03,893 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:11:03,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03 WrapperNode [2024-10-11 09:11:03,894 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:11:03,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:11:03,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:11:03,895 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:11:03,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,950 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-11 09:11:03,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:11:03,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:11:03,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:11:03,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:11:03,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,963 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,967 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,981 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 09:11:03,981 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:03,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:04,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:04,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:11:04,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:11:04,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:11:04,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:11:04,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (1/1) ... [2024-10-11 09:11:04,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:11:04,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:11:04,042 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 09:11:04,044 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 09:11:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:11:04,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:11:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:11:04,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:11:04,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:11:04,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:11:04,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:11:04,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:11:05,891 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 09:11:05,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:11:05,935 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:11:05,935 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:11:05,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:05 BoogieIcfgContainer [2024-10-11 09:11:05,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:11:05,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:11:05,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:11:05,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:11:05,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:11:03" (1/3) ... [2024-10-11 09:11:05,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3980d391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:05, skipping insertion in model container [2024-10-11 09:11:05,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:11:03" (2/3) ... [2024-10-11 09:11:05,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3980d391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:11:05, skipping insertion in model container [2024-10-11 09:11:05,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:11:05" (3/3) ... [2024-10-11 09:11:05,942 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-74.i [2024-10-11 09:11:05,954 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:11:05,954 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:11:06,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:11:06,023 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;@3a91d4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:11:06,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:11:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:11:06,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:11:06,044 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:06,045 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:06,045 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2045449373, now seen corresponding path program 1 times [2024-10-11 09:11:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:06,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904771540] [2024-10-11 09:11:06,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:06,066 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 09:11:06,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:06,070 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 09:11:06,071 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 09:11:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:06,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:11:06,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:11:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-11 09:11:06,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:11:06,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:11:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904771540] [2024-10-11 09:11:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904771540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:11:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:11:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:11:06,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087870537] [2024-10-11 09:11:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:11:06,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:11:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:11:06,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:11:06,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:11:06,530 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:11:08,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:11:08,548 INFO L93 Difference]: Finished difference Result 188 states and 344 transitions. [2024-10-11 09:11:08,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:11:08,574 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2024-10-11 09:11:08,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:11:08,585 INFO L225 Difference]: With dead ends: 188 [2024-10-11 09:11:08,586 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 09:11:08,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:11:08,595 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:11:08,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 09:11:08,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 09:11:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-10-11 09:11:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 09:11:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 147 transitions. [2024-10-11 09:11:08,652 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 147 transitions. Word has length 222 [2024-10-11 09:11:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:11:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 147 transitions. [2024-10-11 09:11:08,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 09:11:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 147 transitions. [2024-10-11 09:11:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:11:08,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:08,661 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:08,678 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 09:11:08,861 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 09:11:08,862 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:08,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1979476533, now seen corresponding path program 1 times [2024-10-11 09:11:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:08,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188407029] [2024-10-11 09:11:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:08,863 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 09:11:08,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:08,870 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 09:11:08,871 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 09:11:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:09,246 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:11:09,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:11:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:11:11,526 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:11:11,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:11:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188407029] [2024-10-11 09:11:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188407029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:11:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:11:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:11:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075707625] [2024-10-11 09:11:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:11:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:11:11,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:11:11,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:11:11,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:11:11,529 INFO L87 Difference]: Start difference. First operand 93 states and 147 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:11:14,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:17,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:11:17,028 INFO L93 Difference]: Finished difference Result 278 states and 440 transitions. [2024-10-11 09:11:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:11:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 09:11:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:11:17,054 INFO L225 Difference]: With dead ends: 278 [2024-10-11 09:11:17,054 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 09:11:17,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:11:17,056 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 80 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:11:17,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 480 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-11 09:11:17,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 09:11:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 157. [2024-10-11 09:11:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 82 states have internal predecessors, (102), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:11:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 246 transitions. [2024-10-11 09:11:17,084 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 246 transitions. Word has length 222 [2024-10-11 09:11:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:11:17,085 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 246 transitions. [2024-10-11 09:11:17,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:11:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 246 transitions. [2024-10-11 09:11:17,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:11:17,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:17,088 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:17,105 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 09:11:17,291 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 09:11:17,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:17,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:17,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1932067069, now seen corresponding path program 1 times [2024-10-11 09:11:17,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301062666] [2024-10-11 09:11:17,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:17,294 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 09:11:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:17,296 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 09:11:17,297 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 09:11:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:17,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:11:17,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:11:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 09:11:19,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:11:19,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:11:19,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301062666] [2024-10-11 09:11:19,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301062666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:11:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:11:19,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:11:19,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206061962] [2024-10-11 09:11:19,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:11:19,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:11:19,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:11:19,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:11:19,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:11:19,518 INFO L87 Difference]: Start difference. First operand 157 states and 246 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:11:22,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:24,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:11:24,933 INFO L93 Difference]: Finished difference Result 278 states and 439 transitions. [2024-10-11 09:11:24,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:11:24,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-11 09:11:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:11:24,959 INFO L225 Difference]: With dead ends: 278 [2024-10-11 09:11:24,959 INFO L226 Difference]: Without dead ends: 186 [2024-10-11 09:11:24,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:11:24,964 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 78 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:11:24,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 481 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-10-11 09:11:24,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-11 09:11:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2024-10-11 09:11:24,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:11:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 247 transitions. [2024-10-11 09:11:24,987 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 247 transitions. Word has length 223 [2024-10-11 09:11:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:11:24,988 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 247 transitions. [2024-10-11 09:11:24,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 09:11:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 247 transitions. [2024-10-11 09:11:24,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:11:24,991 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:24,991 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:25,008 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 09:11:25,195 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 09:11:25,196 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:25,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:25,197 INFO L85 PathProgramCache]: Analyzing trace with hash 368755521, now seen corresponding path program 1 times [2024-10-11 09:11:25,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:25,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [638086213] [2024-10-11 09:11:25,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:25,198 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 09:11:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:25,205 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 09:11:25,209 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 09:11:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:25,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:11:25,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:11:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 989 proven. 78 refuted. 0 times theorem prover too weak. 1453 trivial. 0 not checked. [2024-10-11 09:11:25,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:11:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 27 proven. 78 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:11:26,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:11:26,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [638086213] [2024-10-11 09:11:26,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [638086213] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:11:26,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:11:26,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 09:11:26,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90888722] [2024-10-11 09:11:26,375 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:11:26,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:11:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:11:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:11:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:11:26,376 INFO L87 Difference]: Start difference. First operand 158 states and 247 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-11 09:11:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:11:28,276 INFO L93 Difference]: Finished difference Result 265 states and 405 transitions. [2024-10-11 09:11:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:11:28,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 223 [2024-10-11 09:11:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:11:28,278 INFO L225 Difference]: With dead ends: 265 [2024-10-11 09:11:28,279 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 09:11:28,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 438 SyntacticMatches, 1 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 09:11:28,280 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 52 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 09:11:28,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 225 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 09:11:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 09:11:28,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 165. [2024-10-11 09:11:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 88 states have internal predecessors, (105), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:11:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 249 transitions. [2024-10-11 09:11:28,329 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 249 transitions. Word has length 223 [2024-10-11 09:11:28,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:11:28,330 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 249 transitions. [2024-10-11 09:11:28,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-11 09:11:28,331 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 249 transitions. [2024-10-11 09:11:28,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:11:28,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:28,332 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:28,354 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-10-11 09:11:28,536 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 09:11:28,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -218050493, now seen corresponding path program 1 times [2024-10-11 09:11:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363774859] [2024-10-11 09:11:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:28,539 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 09:11:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:28,542 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 09:11:28,543 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 09:11:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:28,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 09:11:28,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:11:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1082 proven. 144 refuted. 0 times theorem prover too weak. 1294 trivial. 0 not checked. [2024-10-11 09:11:29,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:11:30,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 30 proven. 75 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2024-10-11 09:11:30,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:11:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363774859] [2024-10-11 09:11:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363774859] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:11:30,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:11:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-11 09:11:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765745700] [2024-10-11 09:11:30,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:11:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 09:11:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:11:30,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 09:11:30,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-11 09:11:30,447 INFO L87 Difference]: Start difference. First operand 165 states and 249 transitions. Second operand has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-11 09:11:32,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:11:33,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:11:33,244 INFO L93 Difference]: Finished difference Result 334 states and 483 transitions. [2024-10-11 09:11:33,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 09:11:33,250 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) Word has length 223 [2024-10-11 09:11:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:11:33,252 INFO L225 Difference]: With dead ends: 334 [2024-10-11 09:11:33,256 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 09:11:33,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-11 09:11:33,258 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 185 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:11:33,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 527 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 09:11:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 09:11:33,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 217. [2024-10-11 09:11:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 127 states have (on average 1.220472440944882) internal successors, (155), 128 states have internal predecessors, (155), 80 states have call successors, (80), 9 states have call predecessors, (80), 9 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 09:11:33,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 315 transitions. [2024-10-11 09:11:33,323 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 315 transitions. Word has length 223 [2024-10-11 09:11:33,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:11:33,328 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 315 transitions. [2024-10-11 09:11:33,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 16 states have internal predecessors, (84), 4 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (62), 4 states have call predecessors, (62), 4 states have call successors, (62) [2024-10-11 09:11:33,328 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 315 transitions. [2024-10-11 09:11:33,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 09:11:33,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:11:33,330 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:11:33,350 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 09:11:33,537 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 09:11:33,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:11:33,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:11:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash 483014085, now seen corresponding path program 1 times [2024-10-11 09:11:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:11:33,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412694572] [2024-10-11 09:11:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:11:33,539 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 09:11:33,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:11:33,541 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 09:11:33,542 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 09:11:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:11:34,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 09:11:34,132 INFO L278 TraceCheckSpWp]: Computing forward predicates...