./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.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 b76990f7b16be84f96b6cccf4d605bb8a6382c63bc4ca471da0f4bf5dcf9e35b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:16:40,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:16:40,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:16:40,174 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:16:40,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:16:40,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:16:40,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:16:40,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:16:40,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:16:40,214 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:16:40,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:16:40,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:16:40,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:16:40,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:16:40,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:16:40,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:16:40,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:16:40,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:16:40,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:16:40,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:16:40,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:16:40,219 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:16:40,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:16:40,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:16:40,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:16:40,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:16:40,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:16:40,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:16:40,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:16:40,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:16:40,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:16:40,223 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 -> b76990f7b16be84f96b6cccf4d605bb8a6382c63bc4ca471da0f4bf5dcf9e35b [2024-10-11 10:16:40,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:16:40,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:16:40,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:16:40,471 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:16:40,471 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:16:40,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:16:42,010 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:16:42,216 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:16:42,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:16:42,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a77bba881/34ce732ab7c64eecbb230cda5a0ae007/FLAG92f3eb61b [2024-10-11 10:16:42,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a77bba881/34ce732ab7c64eecbb230cda5a0ae007 [2024-10-11 10:16:42,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:16:42,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:16:42,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:16:42,251 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:16:42,255 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:16:42,256 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6021d31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42, skipping insertion in model container [2024-10-11 10:16:42,257 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:16:42,424 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i[919,932] [2024-10-11 10:16:42,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:16:42,523 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:16:42,533 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i[919,932] [2024-10-11 10:16:42,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:16:42,578 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:16:42,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42 WrapperNode [2024-10-11 10:16:42,579 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:16:42,580 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:16:42,580 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:16:42,580 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:16:42,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,678 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 286 [2024-10-11 10:16:42,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:16:42,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:16:42,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:16:42,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:16:42,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,689 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,748 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:16:42,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,784 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,788 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:16:42,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:16:42,798 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:16:42,798 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:16:42,799 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (1/1) ... [2024-10-11 10:16:42,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:16:42,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:16:42,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:16:42,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:16:42,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:16:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:16:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:16:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:16:42,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:16:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:16:42,925 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:16:42,927 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:16:43,300 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 10:16:43,301 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:16:43,319 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:16:43,320 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:16:43,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:16:43 BoogieIcfgContainer [2024-10-11 10:16:43,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:16:43,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:16:43,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:16:43,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:16:43,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:16:42" (1/3) ... [2024-10-11 10:16:43,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:16:43, skipping insertion in model container [2024-10-11 10:16:43,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:42" (2/3) ... [2024-10-11 10:16:43,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@610ccf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:16:43, skipping insertion in model container [2024-10-11 10:16:43,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:16:43" (3/3) ... [2024-10-11 10:16:43,328 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:16:43,341 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:16:43,341 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:16:43,403 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:16:43,409 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;@580e0c43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:16:43,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:16:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:16:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 10:16:43,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:43,430 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:43,431 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:43,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:43,435 INFO L85 PathProgramCache]: Analyzing trace with hash 868367855, now seen corresponding path program 1 times [2024-10-11 10:16:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:43,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290966694] [2024-10-11 10:16:43,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:43,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:43,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:43,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:43,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:43,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290966694] [2024-10-11 10:16:43,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290966694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:43,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:43,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:16:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744408665] [2024-10-11 10:16:43,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:43,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:16:43,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:43,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:16:43,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:16:43,928 INFO L87 Difference]: Start difference. First operand has 115 states, 78 states have (on average 1.5) internal successors, (117), 79 states have internal predecessors, (117), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:16:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:43,976 INFO L93 Difference]: Finished difference Result 227 states and 402 transitions. [2024-10-11 10:16:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:16:43,978 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 216 [2024-10-11 10:16:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:43,985 INFO L225 Difference]: With dead ends: 227 [2024-10-11 10:16:43,985 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 10:16:43,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:16:43,992 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:43,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:16:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 10:16:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 10:16:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 77 states have internal predecessors, (112), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:16:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2024-10-11 10:16:44,031 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 216 [2024-10-11 10:16:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:44,031 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2024-10-11 10:16:44,031 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:16:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2024-10-11 10:16:44,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 10:16:44,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:44,035 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:44,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:16:44,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:44,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:44,036 INFO L85 PathProgramCache]: Analyzing trace with hash 145895011, now seen corresponding path program 1 times [2024-10-11 10:16:44,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:44,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959141244] [2024-10-11 10:16:44,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:44,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:44,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:44,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:44,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:44,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:44,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959141244] [2024-10-11 10:16:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959141244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:16:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882288125] [2024-10-11 10:16:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:44,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:16:44,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:44,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:16:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:44,402 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:44,454 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2024-10-11 10:16:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:16:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 216 [2024-10-11 10:16:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:44,457 INFO L225 Difference]: With dead ends: 225 [2024-10-11 10:16:44,457 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 10:16:44,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:44,459 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:44,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 514 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:16:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 10:16:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 10:16:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 77 states have internal predecessors, (111), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:16:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 179 transitions. [2024-10-11 10:16:44,479 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 179 transitions. Word has length 216 [2024-10-11 10:16:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:44,482 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 179 transitions. [2024-10-11 10:16:44,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 179 transitions. [2024-10-11 10:16:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 10:16:44,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:44,485 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:44,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:16:44,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:44,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash -599394685, now seen corresponding path program 1 times [2024-10-11 10:16:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104917385] [2024-10-11 10:16:44,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:44,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:44,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:44,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:44,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104917385] [2024-10-11 10:16:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104917385] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:16:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457361184] [2024-10-11 10:16:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:44,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:16:44,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:44,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:16:44,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:44,925 INFO L87 Difference]: Start difference. First operand 113 states and 179 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:45,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:45,127 INFO L93 Difference]: Finished difference Result 338 states and 536 transitions. [2024-10-11 10:16:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:16:45,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 217 [2024-10-11 10:16:45,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:45,132 INFO L225 Difference]: With dead ends: 338 [2024-10-11 10:16:45,132 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 10:16:45,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:16:45,134 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 148 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:45,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 494 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:16:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 10:16:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 210. [2024-10-11 10:16:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 139 states have (on average 1.4316546762589928) internal successors, (199), 139 states have internal predecessors, (199), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 10:16:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 335 transitions. [2024-10-11 10:16:45,174 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 335 transitions. Word has length 217 [2024-10-11 10:16:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:45,175 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 335 transitions. [2024-10-11 10:16:45,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 335 transitions. [2024-10-11 10:16:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 10:16:45,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:45,178 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:45,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:16:45,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:45,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:45,179 INFO L85 PathProgramCache]: Analyzing trace with hash 13831541, now seen corresponding path program 1 times [2024-10-11 10:16:45,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:45,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135100108] [2024-10-11 10:16:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:45,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:45,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:45,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135100108] [2024-10-11 10:16:45,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135100108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:45,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:45,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:16:45,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542665953] [2024-10-11 10:16:45,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:45,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:16:45,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:45,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:16:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:45,556 INFO L87 Difference]: Start difference. First operand 210 states and 335 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:45,725 INFO L93 Difference]: Finished difference Result 471 states and 744 transitions. [2024-10-11 10:16:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:16:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2024-10-11 10:16:45,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:45,728 INFO L225 Difference]: With dead ends: 471 [2024-10-11 10:16:45,728 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 10:16:45,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:16:45,730 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 185 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:45,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 519 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:16:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 10:16:45,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 327. [2024-10-11 10:16:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 221 states have internal predecessors, (315), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 10:16:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 519 transitions. [2024-10-11 10:16:45,757 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 519 transitions. Word has length 218 [2024-10-11 10:16:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:45,758 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 519 transitions. [2024-10-11 10:16:45,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 519 transitions. [2024-10-11 10:16:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:16:45,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:45,760 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:45,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:16:45,761 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:45,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:45,761 INFO L85 PathProgramCache]: Analyzing trace with hash 20589256, now seen corresponding path program 1 times [2024-10-11 10:16:45,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:45,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222745383] [2024-10-11 10:16:45,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:45,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:45,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:46,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:46,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222745383] [2024-10-11 10:16:46,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222745383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:46,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:16:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686265767] [2024-10-11 10:16:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:46,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:16:46,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:16:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:16:46,015 INFO L87 Difference]: Start difference. First operand 327 states and 519 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:46,087 INFO L93 Difference]: Finished difference Result 804 states and 1276 transitions. [2024-10-11 10:16:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:16:46,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-10-11 10:16:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:46,091 INFO L225 Difference]: With dead ends: 804 [2024-10-11 10:16:46,091 INFO L226 Difference]: Without dead ends: 571 [2024-10-11 10:16:46,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:16:46,093 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 111 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:46,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 509 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:16:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-11 10:16:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2024-10-11 10:16:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 393 states have (on average 1.4325699745547074) internal successors, (563), 393 states have internal predecessors, (563), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 10:16:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 903 transitions. [2024-10-11 10:16:46,139 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 903 transitions. Word has length 219 [2024-10-11 10:16:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:46,140 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 903 transitions. [2024-10-11 10:16:46,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 903 transitions. [2024-10-11 10:16:46,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 10:16:46,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:46,142 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:46,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:16:46,142 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 700647626, now seen corresponding path program 1 times [2024-10-11 10:16:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:46,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424420405] [2024-10-11 10:16:46,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:46,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:46,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:46,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424420405] [2024-10-11 10:16:46,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424420405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:46,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:46,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:16:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080707014] [2024-10-11 10:16:46,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:46,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:16:46,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:46,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:16:46,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:46,501 INFO L87 Difference]: Start difference. First operand 569 states and 903 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:46,713 INFO L93 Difference]: Finished difference Result 1113 states and 1750 transitions. [2024-10-11 10:16:46,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:16:46,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-10-11 10:16:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:46,718 INFO L225 Difference]: With dead ends: 1113 [2024-10-11 10:16:46,718 INFO L226 Difference]: Without dead ends: 627 [2024-10-11 10:16:46,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:16:46,720 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 140 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:46,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 494 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:16:46,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-10-11 10:16:46,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 577. [2024-10-11 10:16:46,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 401 states have (on average 1.4214463840399003) internal successors, (570), 401 states have internal predecessors, (570), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 10:16:46,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 910 transitions. [2024-10-11 10:16:46,767 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 910 transitions. Word has length 219 [2024-10-11 10:16:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:46,768 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 910 transitions. [2024-10-11 10:16:46,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 910 transitions. [2024-10-11 10:16:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 10:16:46,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:46,769 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:16:46,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash 675098586, now seen corresponding path program 1 times [2024-10-11 10:16:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98737326] [2024-10-11 10:16:46,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:46,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:47,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:47,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:47,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:47,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:47,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:47,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98737326] [2024-10-11 10:16:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98737326] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:16:47,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254649494] [2024-10-11 10:16:47,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:47,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:16:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:16:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:16:47,189 INFO L87 Difference]: Start difference. First operand 577 states and 910 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:47,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:47,437 INFO L93 Difference]: Finished difference Result 1631 states and 2558 transitions. [2024-10-11 10:16:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:16:47,438 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 10:16:47,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:47,443 INFO L225 Difference]: With dead ends: 1631 [2024-10-11 10:16:47,444 INFO L226 Difference]: Without dead ends: 1133 [2024-10-11 10:16:47,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:16:47,446 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 216 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:47,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 612 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:16:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2024-10-11 10:16:47,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1049. [2024-10-11 10:16:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1049 states, 733 states have (on average 1.417462482946794) internal successors, (1039), 733 states have internal predecessors, (1039), 306 states have call successors, (306), 9 states have call predecessors, (306), 9 states have return successors, (306), 306 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-11 10:16:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1049 states to 1049 states and 1651 transitions. [2024-10-11 10:16:47,568 INFO L78 Accepts]: Start accepts. Automaton has 1049 states and 1651 transitions. Word has length 220 [2024-10-11 10:16:47,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:47,568 INFO L471 AbstractCegarLoop]: Abstraction has 1049 states and 1651 transitions. [2024-10-11 10:16:47,569 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:47,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1049 states and 1651 transitions. [2024-10-11 10:16:47,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 10:16:47,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:47,571 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:47,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:16:47,572 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:47,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:47,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1097800412, now seen corresponding path program 1 times [2024-10-11 10:16:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:47,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806998480] [2024-10-11 10:16:47,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:47,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:47,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:47,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:47,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:47,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806998480] [2024-10-11 10:16:47,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806998480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:16:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139154097] [2024-10-11 10:16:47,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:47,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:16:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:47,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:16:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:16:47,884 INFO L87 Difference]: Start difference. First operand 1049 states and 1651 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:48,056 INFO L93 Difference]: Finished difference Result 2095 states and 3299 transitions. [2024-10-11 10:16:48,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:16:48,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 10:16:48,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:48,063 INFO L225 Difference]: With dead ends: 2095 [2024-10-11 10:16:48,064 INFO L226 Difference]: Without dead ends: 1193 [2024-10-11 10:16:48,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:16:48,068 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 37 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:48,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 811 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:16:48,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-10-11 10:16:48,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1127. [2024-10-11 10:16:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 811 states have (on average 1.406905055487053) internal successors, (1141), 811 states have internal predecessors, (1141), 306 states have call successors, (306), 9 states have call predecessors, (306), 9 states have return successors, (306), 306 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-11 10:16:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1753 transitions. [2024-10-11 10:16:48,153 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1753 transitions. Word has length 220 [2024-10-11 10:16:48,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 1127 states and 1753 transitions. [2024-10-11 10:16:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1753 transitions. [2024-10-11 10:16:48,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-11 10:16:48,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:48,157 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:48,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:16:48,157 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:48,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:48,158 INFO L85 PathProgramCache]: Analyzing trace with hash 123230276, now seen corresponding path program 1 times [2024-10-11 10:16:48,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:48,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913757263] [2024-10-11 10:16:48,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:48,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:48,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 10:16:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913757263] [2024-10-11 10:16:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913757263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:16:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548870354] [2024-10-11 10:16:48,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:48,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:16:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:16:48,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:16:48,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 10:16:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:48,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:16:48,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:16:48,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 945 proven. 27 refuted. 0 times theorem prover too weak. 1272 trivial. 0 not checked. [2024-10-11 10:16:48,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:16:48,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 10:16:48,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548870354] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:16:48,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:16:48,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-11 10:16:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697296526] [2024-10-11 10:16:48,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:16:48,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:16:48,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:48,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:16:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:16:48,887 INFO L87 Difference]: Start difference. First operand 1127 states and 1753 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-10-11 10:16:49,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:49,274 INFO L93 Difference]: Finished difference Result 2283 states and 3482 transitions. [2024-10-11 10:16:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 10:16:49,275 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) Word has length 225 [2024-10-11 10:16:49,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:49,281 INFO L225 Difference]: With dead ends: 2283 [2024-10-11 10:16:49,281 INFO L226 Difference]: Without dead ends: 1217 [2024-10-11 10:16:49,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2024-10-11 10:16:49,284 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 378 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:49,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 284 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:16:49,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-10-11 10:16:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1199. [2024-10-11 10:16:49,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 865 states have (on average 1.2982658959537572) internal successors, (1123), 865 states have internal predecessors, (1123), 306 states have call successors, (306), 27 states have call predecessors, (306), 27 states have return successors, (306), 306 states have call predecessors, (306), 306 states have call successors, (306) [2024-10-11 10:16:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1735 transitions. [2024-10-11 10:16:49,369 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1735 transitions. Word has length 225 [2024-10-11 10:16:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:49,369 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1735 transitions. [2024-10-11 10:16:49,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 4 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (56), 4 states have call predecessors, (56), 4 states have call successors, (56) [2024-10-11 10:16:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1735 transitions. [2024-10-11 10:16:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 10:16:49,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:49,371 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:49,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 10:16:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:16:49,573 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1072139362, now seen corresponding path program 1 times [2024-10-11 10:16:49,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741472350] [2024-10-11 10:16:49,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:49,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:16:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:16:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:16:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:16:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:16:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:16:49,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:16:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:16:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:16:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:16:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:16:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:16:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:16:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 10:16:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 10:16:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 10:16:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 10:16:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 10:16:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 10:16:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 10:16:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 10:16:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 10:16:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 10:16:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 10:16:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 10:16:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 10:16:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-11 10:16:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 10:16:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 10:16:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-11 10:16:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 10:16:49,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 10:16:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-11 10:16:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 10:16:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:16:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:16:49,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:16:49,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741472350] [2024-10-11 10:16:49,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741472350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:16:49,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:16:49,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:16:49,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393389192] [2024-10-11 10:16:49,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:16:49,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:16:49,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:16:49,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:16:49,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:49,729 INFO L87 Difference]: Start difference. First operand 1199 states and 1735 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:49,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:16:49,878 INFO L93 Difference]: Finished difference Result 3136 states and 4560 transitions. [2024-10-11 10:16:49,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:16:49,878 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 230 [2024-10-11 10:16:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:16:49,887 INFO L225 Difference]: With dead ends: 3136 [2024-10-11 10:16:49,887 INFO L226 Difference]: Without dead ends: 2022 [2024-10-11 10:16:49,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:16:49,891 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 118 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:16:49,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 484 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:16:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2024-10-11 10:16:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2012. [2024-10-11 10:16:50,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2012 states, 1509 states have (on average 1.3240556660039762) internal successors, (1998), 1517 states have internal predecessors, (1998), 466 states have call successors, (466), 36 states have call predecessors, (466), 36 states have return successors, (466), 458 states have call predecessors, (466), 466 states have call successors, (466) [2024-10-11 10:16:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 2930 transitions. [2024-10-11 10:16:50,047 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 2930 transitions. Word has length 230 [2024-10-11 10:16:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:16:50,047 INFO L471 AbstractCegarLoop]: Abstraction has 2012 states and 2930 transitions. [2024-10-11 10:16:50,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:16:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 2930 transitions. [2024-10-11 10:16:50,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-10-11 10:16:50,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:16:50,049 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:50,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:16:50,050 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:16:50,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:16:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1581612452, now seen corresponding path program 1 times [2024-10-11 10:16:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:16:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056591812] [2024-10-11 10:16:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:50,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:16:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:16:50,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979412322] [2024-10-11 10:16:50,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:16:50,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:16:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:16:50,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 10:16:50,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 10:16:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:16:50,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:16:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:16:50,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:16:50,462 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:16:50,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:16:50,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:16:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:16:50,674 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:16:50,775 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:16:50,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:16:50 BoogieIcfgContainer [2024-10-11 10:16:50,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:16:50,777 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:16:50,777 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:16:50,777 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:16:50,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:16:43" (3/4) ... [2024-10-11 10:16:50,779 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:16:50,780 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:16:50,780 INFO L158 Benchmark]: Toolchain (without parser) took 8531.83ms. Allocated memory was 207.6MB in the beginning and 484.4MB in the end (delta: 276.8MB). Free memory was 138.2MB in the beginning and 347.5MB in the end (delta: -209.3MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,781 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:16:50,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.69ms. Allocated memory is still 207.6MB. Free memory was 137.9MB in the beginning and 118.7MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.16ms. Allocated memory is still 207.6MB. Free memory was 118.7MB in the beginning and 172.3MB in the end (delta: -53.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,781 INFO L158 Benchmark]: Boogie Preprocessor took 116.77ms. Allocated memory is still 207.6MB. Free memory was 172.3MB in the beginning and 159.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,781 INFO L158 Benchmark]: RCFGBuilder took 522.59ms. Allocated memory is still 207.6MB. Free memory was 159.7MB in the beginning and 113.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,782 INFO L158 Benchmark]: TraceAbstraction took 7455.29ms. Allocated memory was 207.6MB in the beginning and 484.4MB in the end (delta: 276.8MB). Free memory was 112.7MB in the beginning and 347.5MB in the end (delta: -234.8MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2024-10-11 10:16:50,782 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 484.4MB. Free memory is still 347.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:16:50,783 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.16ms. Allocated memory is still 117.4MB. Free memory is still 82.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.69ms. Allocated memory is still 207.6MB. Free memory was 137.9MB in the beginning and 118.7MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.16ms. Allocated memory is still 207.6MB. Free memory was 118.7MB in the beginning and 172.3MB in the end (delta: -53.5MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.77ms. Allocated memory is still 207.6MB. Free memory was 172.3MB in the beginning and 159.7MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 522.59ms. Allocated memory is still 207.6MB. Free memory was 159.7MB in the beginning and 113.5MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7455.29ms. Allocated memory was 207.6MB in the beginning and 484.4MB in the end (delta: 276.8MB). Free memory was 112.7MB in the beginning and 347.5MB in the end (delta: -234.8MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 484.4MB. Free memory is still 347.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of bitwiseOr at line 191, overapproximation of someBinaryArithmeticDOUBLEoperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char var_1_22 = 2; [L42] unsigned char var_1_23 = 32; [L43] unsigned short int var_1_24 = 8; [L44] signed long int var_1_25 = -64; [L45] unsigned short int var_1_26 = 26914; [L46] unsigned short int var_1_27 = 26182; [L47] unsigned char var_1_28 = 5; [L48] unsigned char var_1_29 = 50; [L49] unsigned char var_1_30 = 10; [L50] signed long int var_1_31 = -32; [L51] unsigned char var_1_32 = 0; [L52] unsigned char var_1_33 = 1; [L53] unsigned char var_1_34 = 0; [L54] signed long int var_1_35 = 1000000; [L55] signed long int var_1_36 = 64; [L56] unsigned char last_1_var_1_3 = 64; [L57] unsigned short int last_1_var_1_6 = 10; [L58] unsigned short int last_1_var_1_15 = 5; [L59] unsigned short int last_1_var_1_20 = 50; [L60] unsigned short int last_1_var_1_21 = 0; [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L184] last_1_var_1_3 = var_1_3 [L185] last_1_var_1_6 = var_1_6 [L186] last_1_var_1_15 = var_1_15 [L187] last_1_var_1_20 = var_1_20 [L188] last_1_var_1_21 = var_1_21 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L129] var_1_4 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L130] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L131] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L132] var_1_5 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L133] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L134] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L135] var_1_9 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L136] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L137] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L138] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L139] var_1_10 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L140] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L141] var_1_11 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L142] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L143] var_1_12 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L144] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L146] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L148] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L149] var_1_17 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L150] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L151] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L152] var_1_18 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L153] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L154] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L155] var_1_19 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L156] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L157] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=32, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L158] var_1_23 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L159] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L160] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-64, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L161] var_1_25 = __VERIFIER_nondet_long() [L162] CALL assume_abort_if_not(var_1_25 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L162] RET assume_abort_if_not(var_1_25 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L163] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=26914, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L164] var_1_26 = __VERIFIER_nondet_ushort() [L165] CALL assume_abort_if_not(var_1_26 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L165] RET assume_abort_if_not(var_1_26 >= 16383) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] CALL assume_abort_if_not(var_1_26 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L166] RET assume_abort_if_not(var_1_26 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=26182, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L167] var_1_27 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_27 >= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L168] RET assume_abort_if_not(var_1_27 >= 16384) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] CALL assume_abort_if_not(var_1_27 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L169] RET assume_abort_if_not(var_1_27 <= 32767) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=50, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L171] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=10, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L174] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L175] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=1, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L176] var_1_33 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_33 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L177] RET assume_abort_if_not(var_1_33 >= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] CALL assume_abort_if_not(var_1_33 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L178] RET assume_abort_if_not(var_1_33 <= 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=0, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L179] var_1_34 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L180] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L181] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=2, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L199] RET updateVariables() [L200] CALL step() [L64] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L65] COND TRUE ((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23))) >= var_1_25 [L66] var_1_24 = ((var_1_26 + var_1_27) - var_1_23) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=5, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L68] COND TRUE var_1_27 > 0 [L69] var_1_28 = (((((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) < (0)) ? ((((((var_1_29 + var_1_30)) > (var_1_23)) ? ((var_1_29 + var_1_30)) : (var_1_23)))) : (0))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L71] COND TRUE var_1_26 != 10 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L72] COND FALSE !(var_1_26 <= var_1_29) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L76] COND TRUE var_1_26 > 100 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] EXPR ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L77] COND TRUE (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) ^ var_1_26) > var_1_25 [L78] var_1_32 = (! var_1_33) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=1000000, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L83] var_1_35 = ((((var_1_26) > (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) ? (var_1_26) : (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28)))))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L84] COND FALSE !(var_1_29 > var_1_30) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=64, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] COND FALSE !(var_1_25 >= var_1_22) [L94] var_1_36 = var_1_23 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L102] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-191, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=-191, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L110] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_8=15/8, var_1_9=66] [L111] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L112] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=-4, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L118] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L119] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L120] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L121] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L121] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L124] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L125] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L191] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L191] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L191] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L191-L192] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=319, var_1_16=0, var_1_17=31, var_1_18=-31, var_1_19=0, var_1_1=0, var_1_20=254, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=32768, var_1_25=-1, var_1_26=16384, var_1_27=16384, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-32, var_1_32=0, var_1_33=-255, var_1_34=-256, var_1_35=16384, var_1_36=0, var_1_3=64, var_1_4=254, var_1_5=-191, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 11, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1334 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1333 mSDsluCounter, 4898 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3250 mSDsCounter, 633 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 633 mSolverCounterUnsat, 1648 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1224 GetRequests, 1181 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=10, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 263 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2885 NumberOfCodeBlocks, 2885 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2638 ConstructedInterpolants, 0 QuantifiedInterpolants, 5742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 508 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 26841/26928 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 10:16:50,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.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 b76990f7b16be84f96b6cccf4d605bb8a6382c63bc4ca471da0f4bf5dcf9e35b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:16:53,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:16:53,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:16:53,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:16:53,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:16:53,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:16:53,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:16:53,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:16:53,401 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:16:53,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:16:53,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:16:53,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:16:53,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:16:53,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:16:53,403 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:16:53,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:16:53,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:16:53,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:16:53,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:16:53,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:16:53,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:16:53,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:16:53,406 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:16:53,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:16:53,407 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:16:53,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:16:53,407 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:16:53,407 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:16:53,407 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:16:53,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:16:53,408 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:16:53,408 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:16:53,408 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:16:53,408 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:16:53,417 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:16:53,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:16:53,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:16:53,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:16:53,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:16:53,418 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:16:53,418 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 -> b76990f7b16be84f96b6cccf4d605bb8a6382c63bc4ca471da0f4bf5dcf9e35b [2024-10-11 10:16:53,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:16:53,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:16:53,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:16:53,746 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:16:53,746 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:16:53,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:16:55,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:16:55,498 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:16:55,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:16:55,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e308a988/307650bcd22e4b8c8a6fc9264941cfe1/FLAGcdf58d422 [2024-10-11 10:16:55,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1e308a988/307650bcd22e4b8c8a6fc9264941cfe1 [2024-10-11 10:16:55,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:16:55,528 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:16:55,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:16:55,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:16:55,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:16:55,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,536 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261d3c46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55, skipping insertion in model container [2024-10-11 10:16:55,536 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:16:55,720 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i[919,932] [2024-10-11 10:16:55,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:16:55,794 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:16:55,807 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i[919,932] [2024-10-11 10:16:55,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:16:55,879 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:16:55,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55 WrapperNode [2024-10-11 10:16:55,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:16:55,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:16:55,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:16:55,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:16:55,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,933 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-11 10:16:55,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:16:55,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:16:55,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:16:55,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:16:55,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,973 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 10:16:55,973 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,986 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:55,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:56,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:56,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:16:56,013 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:16:56,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:16:56,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:16:56,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (1/1) ... [2024-10-11 10:16:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:16:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:16:56,043 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 10:16:56,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 10:16:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:16:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:16:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:16:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:16:56,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:16:56,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:16:56,183 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:16:56,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:17:02,582 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:17:02,583 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:17:02,647 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:17:02,647 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:17:02,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:17:02 BoogieIcfgContainer [2024-10-11 10:17:02,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:17:02,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:17:02,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:17:02,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:17:02,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:16:55" (1/3) ... [2024-10-11 10:17:02,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4e971b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:17:02, skipping insertion in model container [2024-10-11 10:17:02,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:16:55" (2/3) ... [2024-10-11 10:17:02,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4e971b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:17:02, skipping insertion in model container [2024-10-11 10:17:02,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:17:02" (3/3) ... [2024-10-11 10:17:02,656 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-78.i [2024-10-11 10:17:02,669 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:17:02,669 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:17:02,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:17:02,731 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;@256dddac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:17:02,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:17:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:17:02,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 10:17:02,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:17:02,750 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:17:02,751 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:17:02,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:17:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1405005544, now seen corresponding path program 1 times [2024-10-11 10:17:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:17:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994124699] [2024-10-11 10:17:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:02,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:17:02,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:17:02,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 10:17:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:03,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:17:03,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2024-10-11 10:17:03,346 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:17:03,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:17:03,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994124699] [2024-10-11 10:17:03,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994124699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:17:03,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:17:03,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:17:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416142363] [2024-10-11 10:17:03,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:17:03,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:17:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:17:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:17:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:17:03,383 INFO L87 Difference]: Start difference. First operand has 87 states, 50 states have (on average 1.42) internal successors, (71), 51 states have internal predecessors, (71), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:17:07,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:17:07,531 INFO L93 Difference]: Finished difference Result 171 states and 310 transitions. [2024-10-11 10:17:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:17:07,564 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 210 [2024-10-11 10:17:07,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:17:07,571 INFO L225 Difference]: With dead ends: 171 [2024-10-11 10:17:07,571 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 10:17:07,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:17:07,578 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:17:07,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-11 10:17:07,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 10:17:07,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-11 10:17:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:17:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 134 transitions. [2024-10-11 10:17:07,623 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 134 transitions. Word has length 210 [2024-10-11 10:17:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:17:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 134 transitions. [2024-10-11 10:17:07,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 10:17:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 134 transitions. [2024-10-11 10:17:07,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 10:17:07,638 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:17:07,638 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:17:07,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:17:07,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:07,843 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:17:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:17:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 775661708, now seen corresponding path program 1 times [2024-10-11 10:17:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:17:07,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314017256] [2024-10-11 10:17:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:07,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:07,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:17:07,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:17:07,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 10:17:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:08,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:17:08,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 956 proven. 48 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2024-10-11 10:17:09,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:17:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 72 proven. 27 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 10:17:10,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:17:10,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314017256] [2024-10-11 10:17:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314017256] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:17:10,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:17:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-10-11 10:17:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271309414] [2024-10-11 10:17:10,449 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:17:10,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:17:10,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:17:10,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:17:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:17:10,452 INFO L87 Difference]: Start difference. First operand 85 states and 134 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-11 10:17:15,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:18,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:17:18,169 INFO L93 Difference]: Finished difference Result 179 states and 275 transitions. [2024-10-11 10:17:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:17:18,203 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 210 [2024-10-11 10:17:18,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:17:18,209 INFO L225 Difference]: With dead ends: 179 [2024-10-11 10:17:18,210 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 10:17:18,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:17:18,215 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 79 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:17:18,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 203 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 203 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-10-11 10:17:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 10:17:18,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2024-10-11 10:17:18,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:17:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 138 transitions. [2024-10-11 10:17:18,241 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 138 transitions. Word has length 210 [2024-10-11 10:17:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:17:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 138 transitions. [2024-10-11 10:17:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-10-11 10:17:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 138 transitions. [2024-10-11 10:17:18,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 10:17:18,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:17:18,245 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:17:18,261 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:17:18,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:18,446 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:17:18,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:17:18,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1525160882, now seen corresponding path program 1 times [2024-10-11 10:17:18,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:17:18,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16823867] [2024-10-11 10:17:18,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:18,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:18,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:17:18,451 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:17:18,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 10:17:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:18,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:17:18,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1058 proven. 60 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2024-10-11 10:17:20,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:17:21,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 33 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 10:17:21,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:17:21,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16823867] [2024-10-11 10:17:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16823867] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:17:21,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:17:21,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2024-10-11 10:17:21,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104854106] [2024-10-11 10:17:21,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:17:21,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 10:17:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:17:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 10:17:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:17:21,208 INFO L87 Difference]: Start difference. First operand 93 states and 138 transitions. Second operand has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-10-11 10:17:26,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:28,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:17:28,596 INFO L93 Difference]: Finished difference Result 195 states and 283 transitions. [2024-10-11 10:17:28,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:17:28,630 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 210 [2024-10-11 10:17:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:17:28,632 INFO L225 Difference]: With dead ends: 195 [2024-10-11 10:17:28,632 INFO L226 Difference]: Without dead ends: 103 [2024-10-11 10:17:28,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:17:28,636 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 120 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 68 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:17:28,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 231 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 280 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2024-10-11 10:17:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-11 10:17:28,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-10-11 10:17:28,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:17:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-10-11 10:17:28,663 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 210 [2024-10-11 10:17:28,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:17:28,669 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-10-11 10:17:28,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.818181818181818) internal successors, (64), 10 states have internal predecessors, (64), 4 states have call successors, (45), 3 states have call predecessors, (45), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-10-11 10:17:28,670 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-10-11 10:17:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-11 10:17:28,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:17:28,672 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:17:28,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:17:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:28,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:17:28,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:17:28,875 INFO L85 PathProgramCache]: Analyzing trace with hash -222049646, now seen corresponding path program 1 times [2024-10-11 10:17:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:17:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805252961] [2024-10-11 10:17:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:28,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:28,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:17:28,878 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:17:28,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:17:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:29,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 10:17:29,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:17:29,288 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:17:29,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:17:29,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805252961] [2024-10-11 10:17:29,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805252961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:17:29,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:17:29,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:17:29,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705212815] [2024-10-11 10:17:29,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:17:29,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:17:29,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:17:29,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:17:29,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:17:29,290 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:17:33,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:17:34,209 INFO L93 Difference]: Finished difference Result 201 states and 281 transitions. [2024-10-11 10:17:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:17:34,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-11 10:17:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:17:34,248 INFO L225 Difference]: With dead ends: 201 [2024-10-11 10:17:34,248 INFO L226 Difference]: Without dead ends: 101 [2024-10-11 10:17:34,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:17:34,249 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 10:17:34,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 246 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 10:17:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-11 10:17:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-11 10:17:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 10:17:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 140 transitions. [2024-10-11 10:17:34,261 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 140 transitions. Word has length 212 [2024-10-11 10:17:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:17:34,262 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 140 transitions. [2024-10-11 10:17:34,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:17:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2024-10-11 10:17:34,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 10:17:34,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:17:34,264 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:17:34,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 10:17:34,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:34,465 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:17:34,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:17:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash -527685955, now seen corresponding path program 1 times [2024-10-11 10:17:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:17:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863821125] [2024-10-11 10:17:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:34,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:17:34,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:17:34,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:17:34,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:17:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:35,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 10:17:35,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 693 proven. 81 refuted. 0 times theorem prover too weak. 1470 trivial. 0 not checked. [2024-10-11 10:17:39,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:17:44,372 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:17:44,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863821125] [2024-10-11 10:17:44,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863821125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:17:44,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [478165619] [2024-10-11 10:17:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:17:44,373 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 10:17:44,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 10:17:44,375 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 10:17:44,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-10-11 10:17:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:17:45,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:17:45,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:17:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 10:17:48,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:17:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [478165619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:17:48,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 10:17:48,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-10-11 10:17:48,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910921478] [2024-10-11 10:17:48,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:17:48,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:17:48,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:17:48,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:17:48,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:17:48,166 INFO L87 Difference]: Start difference. First operand 101 states and 140 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:17:51,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:54,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:17:58,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:18:00,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:18:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:18:01,033 INFO L93 Difference]: Finished difference Result 320 states and 442 transitions. [2024-10-11 10:18:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:18:01,033 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-11 10:18:01,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:18:01,035 INFO L225 Difference]: With dead ends: 320 [2024-10-11 10:18:01,036 INFO L226 Difference]: Without dead ends: 220 [2024-10-11 10:18:01,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:18:01,037 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 42 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-10-11 10:18:01,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 342 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2024-10-11 10:18:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-10-11 10:18:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 215. [2024-10-11 10:18:01,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 133 states have (on average 1.1954887218045114) internal successors, (159), 134 states have internal predecessors, (159), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 10:18:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 299 transitions. [2024-10-11 10:18:01,064 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 299 transitions. Word has length 213 [2024-10-11 10:18:01,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:18:01,065 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 299 transitions. [2024-10-11 10:18:01,065 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 10:18:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 299 transitions. [2024-10-11 10:18:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 10:18:01,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:18:01,071 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:18:01,087 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 (6)] Forceful destruction successful, exit code 0 [2024-10-11 10:18:01,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-10-11 10:18:01,475 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,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 10:18:01,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:18:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:18:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash 152372415, now seen corresponding path program 1 times [2024-10-11 10:18:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:18:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263721143] [2024-10-11 10:18:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:18:01,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:18:01,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:18:01,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:18:01,483 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 (8)] Waiting until timeout for monitored process [2024-10-11 10:18:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:18:02,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-11 10:18:02,337 INFO L278 TraceCheckSpWp]: Computing forward predicates...