./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-co_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5ab0e81ee055b6c57add22d9e0a921ddb236e4c743435b2b92ec98e22ec7f0b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:30:56,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:30:56,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:30:56,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:30:56,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:30:56,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:30:56,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:30:56,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:30:56,795 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:30:56,796 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:30:56,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:30:56,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:30:56,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:30:56,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:30:56,799 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:30:56,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:30:56,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:30:56,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:30:56,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:30:56,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:30:56,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:30:56,802 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:30:56,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:30:56,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:30:56,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:30:56,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:30:56,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:30:56,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:30:56,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:30:56,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:30:56,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:30:56,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:30:56,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:56,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:30:56,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:30:56,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:30:56,805 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:30:56,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:30:56,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:30:56,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:30:56,806 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:30:56,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:30:56,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5ab0e81ee055b6c57add22d9e0a921ddb236e4c743435b2b92ec98e22ec7f0b [2024-10-14 10:30:57,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:30:57,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:30:57,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:30:57,031 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:30:57,031 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:30:57,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:30:58,236 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:30:58,393 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:30:58,393 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:30:58,400 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb1a126b/48b47e853465494b923ac29ea0a878fb/FLAGe502edccb [2024-10-14 10:30:58,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb1a126b/48b47e853465494b923ac29ea0a878fb [2024-10-14 10:30:58,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:30:58,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:30:58,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:58,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:30:58,803 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:30:58,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:58" (1/1) ... [2024-10-14 10:30:58,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e44f926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:58, skipping insertion in model container [2024-10-14 10:30:58,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:30:58" (1/1) ... [2024-10-14 10:30:58,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:30:58,975 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-co_file-38.i[919,932] [2024-10-14 10:30:59,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:59,067 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:30:59,082 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-co_file-38.i[919,932] [2024-10-14 10:30:59,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:30:59,130 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:30:59,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59 WrapperNode [2024-10-14 10:30:59,131 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:30:59,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:59,132 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:30:59,132 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:30:59,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,151 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,181 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-14 10:30:59,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:30:59,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:30:59,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:30:59,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:30:59,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,201 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,215 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-14 10:30:59,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,224 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:30:59,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:30:59,239 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:30:59,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:30:59,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (1/1) ... [2024-10-14 10:30:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:30:59,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:30:59,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:30:59,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:30:59,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:30:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:30:59,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:30:59,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:30:59,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:30:59,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:30:59,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:30:59,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:30:59,674 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:30:59,674 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:30:59,697 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:30:59,697 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:30:59,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:59 BoogieIcfgContainer [2024-10-14 10:30:59,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:30:59,701 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:30:59,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:30:59,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:30:59,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:30:58" (1/3) ... [2024-10-14 10:30:59,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4745e9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:59, skipping insertion in model container [2024-10-14 10:30:59,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:30:59" (2/3) ... [2024-10-14 10:30:59,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4745e9ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:30:59, skipping insertion in model container [2024-10-14 10:30:59,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:59" (3/3) ... [2024-10-14 10:30:59,707 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:30:59,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:30:59,724 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:30:59,771 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:30:59,778 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;@68996b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:30:59,778 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:30:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:30:59,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:30:59,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:30:59,798 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:30:59,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:30:59,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:30:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1535605030, now seen corresponding path program 1 times [2024-10-14 10:30:59,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:30:59,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916815127] [2024-10-14 10:30:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:30:59,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:30:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:00,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:00,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916815127] [2024-10-14 10:31:00,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916815127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:00,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:00,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483763216] [2024-10-14 10:31:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:00,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:31:00,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:00,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:31:00,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:00,227 INFO L87 Difference]: Start difference. First operand has 96 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:31:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:00,271 INFO L93 Difference]: Finished difference Result 189 states and 343 transitions. [2024-10-14 10:31:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:31:00,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 205 [2024-10-14 10:31:00,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:00,280 INFO L225 Difference]: With dead ends: 189 [2024-10-14 10:31:00,281 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 10:31:00,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 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-14 10:31:00,289 INFO L432 NwaCegarLoop]: 147 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, 147 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-14 10:31:00,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 10:31:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-14 10:31:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 59 states have internal predecessors, (84), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:31:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 150 transitions. [2024-10-14 10:31:00,365 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 150 transitions. Word has length 205 [2024-10-14 10:31:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:00,366 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 150 transitions. [2024-10-14 10:31:00,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:31:00,366 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 150 transitions. [2024-10-14 10:31:00,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:31:00,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:00,369 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:00,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:31:00,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1973079076, now seen corresponding path program 1 times [2024-10-14 10:31:00,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811392644] [2024-10-14 10:31:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:00,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811392644] [2024-10-14 10:31:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811392644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:00,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:00,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:31:00,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613767699] [2024-10-14 10:31:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:00,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:31:00,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:00,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:31:00,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:31:00,766 INFO L87 Difference]: Start difference. First operand 94 states and 150 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:00,860 INFO L93 Difference]: Finished difference Result 260 states and 417 transitions. [2024-10-14 10:31:00,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:31:00,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-14 10:31:00,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:00,863 INFO L225 Difference]: With dead ends: 260 [2024-10-14 10:31:00,863 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 10:31:00,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 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-14 10:31:00,865 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 58 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:00,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 404 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:00,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 10:31:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-10-14 10:31:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 91 states have (on average 1.3296703296703296) internal successors, (121), 91 states have internal predecessors, (121), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:31:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 253 transitions. [2024-10-14 10:31:00,892 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 253 transitions. Word has length 205 [2024-10-14 10:31:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:00,892 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 253 transitions. [2024-10-14 10:31:00,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 253 transitions. [2024-10-14 10:31:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 10:31:00,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:00,895 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:31:00,895 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:00,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1773106434, now seen corresponding path program 1 times [2024-10-14 10:31:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303458389] [2024-10-14 10:31:00,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303458389] [2024-10-14 10:31:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303458389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:01,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:31:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865111343] [2024-10-14 10:31:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:01,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:31:01,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:01,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:31:01,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:31:01,318 INFO L87 Difference]: Start difference. First operand 160 states and 253 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:01,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:01,397 INFO L93 Difference]: Finished difference Result 260 states and 415 transitions. [2024-10-14 10:31:01,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:01,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 206 [2024-10-14 10:31:01,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:01,399 INFO L225 Difference]: With dead ends: 260 [2024-10-14 10:31:01,399 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 10:31:01,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:31:01,405 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 57 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:01,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 402 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:31:01,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 10:31:01,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2024-10-14 10:31:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 92 states have (on average 1.326086956521739) internal successors, (122), 92 states have internal predecessors, (122), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:31:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 254 transitions. [2024-10-14 10:31:01,445 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 254 transitions. Word has length 206 [2024-10-14 10:31:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:01,447 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 254 transitions. [2024-10-14 10:31:01,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 254 transitions. [2024-10-14 10:31:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-14 10:31:01,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:01,450 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:01,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:31:01,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:01,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:01,450 INFO L85 PathProgramCache]: Analyzing trace with hash -491677023, now seen corresponding path program 1 times [2024-10-14 10:31:01,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:01,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813466480] [2024-10-14 10:31:01,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:01,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:01,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:01,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:01,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:01,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:01,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:01,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:01,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813466480] [2024-10-14 10:31:01,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813466480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:01,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:01,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:31:01,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496795884] [2024-10-14 10:31:01,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:01,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:01,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:01,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:01,711 INFO L87 Difference]: Start difference. First operand 161 states and 254 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:01,765 INFO L93 Difference]: Finished difference Result 262 states and 416 transitions. [2024-10-14 10:31:01,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:01,766 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 207 [2024-10-14 10:31:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:01,768 INFO L225 Difference]: With dead ends: 262 [2024-10-14 10:31:01,768 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 10:31:01,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-14 10:31:01,772 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 56 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:01,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 272 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:31:01,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 10:31:01,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2024-10-14 10:31:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:31:01,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 253 transitions. [2024-10-14 10:31:01,801 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 253 transitions. Word has length 207 [2024-10-14 10:31:01,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:01,801 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 253 transitions. [2024-10-14 10:31:01,802 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 253 transitions. [2024-10-14 10:31:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-14 10:31:01,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:01,804 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:01,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:31:01,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:01,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:01,804 INFO L85 PathProgramCache]: Analyzing trace with hash 447381886, now seen corresponding path program 1 times [2024-10-14 10:31:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:01,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556713965] [2024-10-14 10:31:01,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:02,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:02,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556713965] [2024-10-14 10:31:02,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556713965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:02,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:02,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:31:02,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375607595] [2024-10-14 10:31:02,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:02,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:31:02,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:02,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:31:02,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:02,191 INFO L87 Difference]: Start difference. First operand 161 states and 253 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:02,426 INFO L93 Difference]: Finished difference Result 435 states and 691 transitions. [2024-10-14 10:31:02,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:31:02,426 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-14 10:31:02,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:02,429 INFO L225 Difference]: With dead ends: 435 [2024-10-14 10:31:02,429 INFO L226 Difference]: Without dead ends: 342 [2024-10-14 10:31:02,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:31:02,430 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 317 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:02,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 556 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:31:02,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-14 10:31:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 329. [2024-10-14 10:31:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 192 states have (on average 1.3333333333333333) internal successors, (256), 192 states have internal predecessors, (256), 132 states have call successors, (132), 4 states have call predecessors, (132), 4 states have return successors, (132), 132 states have call predecessors, (132), 132 states have call successors, (132) [2024-10-14 10:31:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 520 transitions. [2024-10-14 10:31:02,475 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 520 transitions. Word has length 209 [2024-10-14 10:31:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:02,476 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 520 transitions. [2024-10-14 10:31:02,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 520 transitions. [2024-10-14 10:31:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:31:02,478 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:02,478 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:02,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:31:02,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:02,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:02,479 INFO L85 PathProgramCache]: Analyzing trace with hash -760263633, now seen corresponding path program 1 times [2024-10-14 10:31:02,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:02,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138227880] [2024-10-14 10:31:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:02,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:02,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:02,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138227880] [2024-10-14 10:31:02,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138227880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:02,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:02,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:31:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568980362] [2024-10-14 10:31:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:31:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:02,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:31:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:02,872 INFO L87 Difference]: Start difference. First operand 329 states and 520 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:03,135 INFO L93 Difference]: Finished difference Result 901 states and 1430 transitions. [2024-10-14 10:31:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:31:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-14 10:31:03,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:03,142 INFO L225 Difference]: With dead ends: 901 [2024-10-14 10:31:03,142 INFO L226 Difference]: Without dead ends: 640 [2024-10-14 10:31:03,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:31:03,144 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 136 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:03,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 518 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 10:31:03,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-14 10:31:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 590. [2024-10-14 10:31:03,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 351 states have (on average 1.3532763532763532) internal successors, (475), 351 states have internal predecessors, (475), 231 states have call successors, (231), 7 states have call predecessors, (231), 7 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-14 10:31:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 937 transitions. [2024-10-14 10:31:03,216 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 937 transitions. Word has length 210 [2024-10-14 10:31:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 937 transitions. [2024-10-14 10:31:03,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 937 transitions. [2024-10-14 10:31:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-14 10:31:03,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:03,219 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:03,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:31:03,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:03,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:03,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1347069647, now seen corresponding path program 1 times [2024-10-14 10:31:03,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:03,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337964160] [2024-10-14 10:31:03,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:03,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:31:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:31:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:31:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:31:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:31:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:31:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:31:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:31:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:31:03,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:31:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:31:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:31:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 10:31:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:31:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 10:31:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 10:31:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 10:31:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:31:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:31:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:31:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 10:31:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:31:03,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-14 10:31:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:31:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 10:31:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 10:31:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-14 10:31:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-14 10:31:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-14 10:31:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-14 10:31:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-14 10:31:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-14 10:31:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-14 10:31:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:31:03,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:31:03,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337964160] [2024-10-14 10:31:03,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337964160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:31:03,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614370849] [2024-10-14 10:31:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:03,571 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:31:03,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:31:03,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:03,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 10:31:03,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1016 proven. 60 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-10-14 10:31:05,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:31:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2024-10-14 10:31:06,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614370849] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:31:06,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:31:06,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 19 [2024-10-14 10:31:06,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785454731] [2024-10-14 10:31:06,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:31:06,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 10:31:06,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:31:06,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 10:31:06,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-10-14 10:31:06,581 INFO L87 Difference]: Start difference. First operand 590 states and 937 transitions. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-14 10:31:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:08,013 INFO L93 Difference]: Finished difference Result 1440 states and 2244 transitions. [2024-10-14 10:31:08,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-14 10:31:08,013 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) Word has length 210 [2024-10-14 10:31:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:08,018 INFO L225 Difference]: With dead ends: 1440 [2024-10-14 10:31:08,018 INFO L226 Difference]: Without dead ends: 918 [2024-10-14 10:31:08,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 515 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=483, Invalid=1157, Unknown=0, NotChecked=0, Total=1640 [2024-10-14 10:31:08,021 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 504 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:08,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 882 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 10:31:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2024-10-14 10:31:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 652. [2024-10-14 10:31:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 406 states have (on average 1.3596059113300492) internal successors, (552), 406 states have internal predecessors, (552), 231 states have call successors, (231), 14 states have call predecessors, (231), 14 states have return successors, (231), 231 states have call predecessors, (231), 231 states have call successors, (231) [2024-10-14 10:31:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 1014 transitions. [2024-10-14 10:31:08,080 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 1014 transitions. Word has length 210 [2024-10-14 10:31:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 1014 transitions. [2024-10-14 10:31:08,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (99), 3 states have call predecessors, (99), 6 states have return successors, (99), 6 states have call predecessors, (99), 6 states have call successors, (99) [2024-10-14 10:31:08,080 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 1014 transitions. [2024-10-14 10:31:08,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-14 10:31:08,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:08,083 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:08,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:31:08,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:08,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:08,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1431192798, now seen corresponding path program 1 times [2024-10-14 10:31:08,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:31:08,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342285555] [2024-10-14 10:31:08,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:08,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:31:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:31:08,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [913471186] [2024-10-14 10:31:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:08,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:31:08,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:08,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:31:08,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:31:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:31:08,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:31:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:31:08,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:31:08,637 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:31:08,638 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:31:08,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:31:08,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-14 10:31:08,843 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:31:08,961 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:31:08,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:31:08 BoogieIcfgContainer [2024-10-14 10:31:08,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:31:08,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:31:08,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:31:08,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:31:08,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:30:59" (3/4) ... [2024-10-14 10:31:08,965 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:31:08,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:31:08,967 INFO L158 Benchmark]: Toolchain (without parser) took 10168.85ms. Allocated memory was 172.0MB in the beginning and 350.2MB in the end (delta: 178.3MB). Free memory was 101.0MB in the beginning and 306.6MB in the end (delta: -205.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory was 130.0MB in the beginning and 129.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 332.10ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 137.2MB in the end (delta: -36.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.12ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: Boogie Preprocessor took 52.78ms. Allocated memory is still 172.0MB. Free memory was 133.0MB in the beginning and 129.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: RCFGBuilder took 459.46ms. Allocated memory is still 172.0MB. Free memory was 129.6MB in the beginning and 101.5MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-14 10:31:08,967 INFO L158 Benchmark]: TraceAbstraction took 9262.04ms. Allocated memory was 172.0MB in the beginning and 350.2MB in the end (delta: 178.3MB). Free memory was 101.1MB in the beginning and 306.6MB in the end (delta: -205.5MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. [2024-10-14 10:31:08,968 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 350.2MB. Free memory is still 306.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:31:08,968 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.14ms. Allocated memory is still 172.0MB. Free memory was 130.0MB in the beginning and 129.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 332.10ms. Allocated memory is still 172.0MB. Free memory was 100.8MB in the beginning and 137.2MB in the end (delta: -36.4MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.12ms. Allocated memory is still 172.0MB. Free memory was 137.2MB in the beginning and 133.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.78ms. Allocated memory is still 172.0MB. Free memory was 133.0MB in the beginning and 129.6MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 459.46ms. Allocated memory is still 172.0MB. Free memory was 129.6MB in the beginning and 101.5MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9262.04ms. Allocated memory was 172.0MB in the beginning and 350.2MB in the end (delta: 178.3MB). Free memory was 101.1MB in the beginning and 306.6MB in the end (delta: -205.5MB). Peak memory consumption was 171.0MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 350.2MB. Free memory is still 306.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 194, overapproximation of bitwiseOr at line 76, overapproximation of shiftRight at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_31 = 32; [L42] unsigned char var_1_32 = 25; [L43] unsigned char var_1_33 = 128; [L44] double var_1_34 = 499.6; [L45] double var_1_35 = 3.5; [L46] unsigned char var_1_36 = 200; [L47] unsigned short int var_1_37 = 2; [L48] unsigned short int var_1_41 = 36532; [L49] unsigned short int var_1_42 = 32367; [L50] signed char var_1_43 = -2; [L51] signed char var_1_44 = 1; [L52] unsigned short int last_1_var_1_8 = 4; [L53] signed short int last_1_var_1_21 = -64; [L54] signed char last_1_var_1_25 = -128; [L198] isInitial = 1 [L199] FCALL initially() [L200] COND TRUE 1 [L201] CALL updateLastVariables() [L189] last_1_var_1_8 = var_1_8 [L190] last_1_var_1_21 = var_1_21 [L191] last_1_var_1_25 = var_1_25 [L201] RET updateLastVariables() [L202] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L137] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L139] var_1_6 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_7=0, var_1_8=4] [L141] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L142] var_1_11 = __VERIFIER_nondet_long() [L143] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L145] var_1_12 = __VERIFIER_nondet_long() [L146] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L147] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L148] var_1_13 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L149] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L150] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L151] var_1_15 = __VERIFIER_nondet_short() [L152] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L152] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L153] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L154] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L155] var_1_16 = __VERIFIER_nondet_long() [L156] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L156] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L157] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L158] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L159] var_1_17 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L160] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L161] var_1_18 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L162] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L163] var_1_19 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L164] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L165] var_1_20 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L166] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L167] var_1_26 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L168] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L169] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L172] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=25, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L173] var_1_32 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L174] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L175] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_35=7/2, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L176] var_1_35 = __VERIFIER_nondet_double() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=36532, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L178] var_1_41 = __VERIFIER_nondet_ushort() [L179] CALL assume_abort_if_not(var_1_41 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L179] RET assume_abort_if_not(var_1_41 >= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] CALL assume_abort_if_not(var_1_41 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L180] RET assume_abort_if_not(var_1_41 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=32367, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L181] var_1_42 = __VERIFIER_nondet_ushort() [L182] CALL assume_abort_if_not(var_1_42 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L182] RET assume_abort_if_not(var_1_42 >= 16383) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] CALL assume_abort_if_not(var_1_42 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L183] RET assume_abort_if_not(var_1_42 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=1, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L184] var_1_44 = __VERIFIER_nondet_char() [L185] CALL assume_abort_if_not(var_1_44 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L185] RET assume_abort_if_not(var_1_44 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] CALL assume_abort_if_not(var_1_44 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L186] RET assume_abort_if_not(var_1_44 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L202] RET updateVariables() [L203] CALL step() [L58] COND FALSE !(var_1_14 >= (((((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) < 0 ) ? -((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14))) : ((((var_1_14) > (var_1_14)) ? (var_1_14) : (var_1_14)))))) [L65] var_1_27 = var_1_32 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=128, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L67] COND TRUE var_1_14 >= ((((var_1_14) < (var_1_14)) ? (var_1_14) : (var_1_14))) [L68] var_1_33 = ((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2498/5, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L70] var_1_34 = var_1_35 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L71] COND FALSE !(var_1_14 >= var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L76] EXPR ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) | (-10 * var_1_21) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L76] COND FALSE !(-2 > (((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) | (-10 * var_1_21))) [L79] COND TRUE ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) <= ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=2, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L80] COND TRUE (var_1_21 * ((((var_1_8) > (var_1_21)) ? (var_1_8) : (var_1_21)))) <= var_1_25 [L81] var_1_37 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L87] COND FALSE !(var_1_42 > var_1_41) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L94] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L94] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L95] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L99] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L100] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=-1, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L101] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L106] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L108] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L109] COND TRUE \read(var_1_4) [L110] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=9, var_1_16=66, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L113] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L120] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L122] COND TRUE (- var_1_14) <= var_1_14 [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L131] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L132] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L203] RET step() [L204] CALL, EXPR property() [L194] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L194-L195] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L204] RET, EXPR property() [L204] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=-1, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=9, var_1_16=66, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_31=1, var_1_32=0, var_1_33=0, var_1_34=2, var_1_35=2, var_1_36=200, var_1_37=64, var_1_41=32767, var_1_42=16383, var_1_43=-2, var_1_44=-127, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 8, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1168 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1128 mSDsluCounter, 3181 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2196 mSDsCounter, 477 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1644 IncrementalHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 477 mSolverCounterUnsat, 985 mSDtfsCounter, 1644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 969 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=652occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 348 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 2084 NumberOfCodeBlocks, 2084 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1863 ConstructedInterpolants, 0 QuantifiedInterpolants, 10425 SizeOfPredicates, 4 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 18828/19008 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-14 10:31:09,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5ab0e81ee055b6c57add22d9e0a921ddb236e4c743435b2b92ec98e22ec7f0b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:31:10,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:31:10,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:31:10,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:31:10,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:31:10,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:31:10,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:31:10,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:31:10,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:31:10,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:31:10,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:31:10,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:31:10,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:31:10,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:31:10,893 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:31:10,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:31:10,893 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:31:10,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:31:10,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:31:10,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:31:10,897 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:31:10,897 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:31:10,897 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:31:10,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:31:10,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:31:10,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:31:10,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:31:10,898 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:31:10,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:31:10,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:31:10,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:31:10,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:31:10,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:31:10,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:31:10,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:10,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:31:10,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:31:10,900 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:31:10,900 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:31:10,901 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:31:10,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:31:10,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:31:10,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:31:10,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:31:10,903 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:31:10,903 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5ab0e81ee055b6c57add22d9e0a921ddb236e4c743435b2b92ec98e22ec7f0b [2024-10-14 10:31:11,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:31:11,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:31:11,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:31:11,177 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:31:11,178 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:31:11,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:31:12,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:31:12,626 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:31:12,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:31:12,636 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdabd6a07/f4c3a9c6d112496a9669fb1bb8b7a438/FLAG6e22847f0 [2024-10-14 10:31:13,009 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdabd6a07/f4c3a9c6d112496a9669fb1bb8b7a438 [2024-10-14 10:31:13,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:31:13,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:31:13,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:13,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:31:13,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:31:13,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6086a100 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13, skipping insertion in model container [2024-10-14 10:31:13,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:31:13,187 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-co_file-38.i[919,932] [2024-10-14 10:31:13,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:13,295 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:31:13,304 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-co_file-38.i[919,932] [2024-10-14 10:31:13,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:31:13,363 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:31:13,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13 WrapperNode [2024-10-14 10:31:13,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:31:13,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:13,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:31:13,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:31:13,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,418 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-14 10:31:13,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:31:13,421 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:31:13,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:31:13,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:31:13,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,448 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-14 10:31:13,449 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,460 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:31:13,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:31:13,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:31:13,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:31:13,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (1/1) ... [2024-10-14 10:31:13,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:31:13,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:31:13,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:31:13,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:31:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:31:13,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:31:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:31:13,528 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:31:13,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:31:13,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:31:13,608 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:31:13,610 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:31:18,039 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:31:18,040 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:31:18,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:31:18,084 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:31:18,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:18 BoogieIcfgContainer [2024-10-14 10:31:18,085 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:31:18,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:31:18,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:31:18,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:31:18,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:31:13" (1/3) ... [2024-10-14 10:31:18,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50aa8ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:18, skipping insertion in model container [2024-10-14 10:31:18,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:31:13" (2/3) ... [2024-10-14 10:31:18,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50aa8ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:31:18, skipping insertion in model container [2024-10-14 10:31:18,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:31:18" (3/3) ... [2024-10-14 10:31:18,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-38.i [2024-10-14 10:31:18,103 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:31:18,104 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:31:18,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:31:18,161 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;@579f446a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:31:18,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:31:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:31:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 10:31:18,179 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:18,179 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:18,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:18,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:18,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1585615511, now seen corresponding path program 1 times [2024-10-14 10:31:18,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:18,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38890254] [2024-10-14 10:31:18,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:18,195 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-14 10:31:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:18,197 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:18,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:31:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:18,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:31:18,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 1700 trivial. 0 not checked. [2024-10-14 10:31:18,712 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:18,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:18,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38890254] [2024-10-14 10:31:18,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38890254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:18,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:18,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:18,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532360508] [2024-10-14 10:31:18,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:18,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:31:18,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:31:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:31:18,740 INFO L87 Difference]: Start difference. First operand has 86 states, 50 states have (on average 1.5) internal successors, (75), 51 states have internal predecessors, (75), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:31:20,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:20,725 INFO L93 Difference]: Finished difference Result 169 states and 313 transitions. [2024-10-14 10:31:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:31:20,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 201 [2024-10-14 10:31:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:20,768 INFO L225 Difference]: With dead ends: 169 [2024-10-14 10:31:20,769 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 10:31:20,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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-14 10:31:20,773 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:20,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 10:31:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 10:31:20,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-14 10:31:20,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 49 states have internal predecessors, (68), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-14 10:31:20,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 134 transitions. [2024-10-14 10:31:20,812 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 134 transitions. Word has length 201 [2024-10-14 10:31:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:20,812 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 134 transitions. [2024-10-14 10:31:20,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-10-14 10:31:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 134 transitions. [2024-10-14 10:31:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-14 10:31:20,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:20,819 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:20,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 10:31:21,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:21,021 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:21,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:21,021 INFO L85 PathProgramCache]: Analyzing trace with hash -482805109, now seen corresponding path program 1 times [2024-10-14 10:31:21,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:21,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346470374] [2024-10-14 10:31:21,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:21,023 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-14 10:31:21,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:21,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:21,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 10:31:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:21,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 10:31:21,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:22,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:22,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:22,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:22,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346470374] [2024-10-14 10:31:22,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346470374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:22,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:22,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:22,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162794551] [2024-10-14 10:31:22,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:22,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:22,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:22,915 INFO L87 Difference]: Start difference. First operand 84 states and 134 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:26,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:26,895 INFO L93 Difference]: Finished difference Result 242 states and 389 transitions. [2024-10-14 10:31:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:26,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 201 [2024-10-14 10:31:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:26,900 INFO L225 Difference]: With dead ends: 242 [2024-10-14 10:31:26,900 INFO L226 Difference]: Without dead ends: 159 [2024-10-14 10:31:26,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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-14 10:31:26,902 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 27 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:26,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 229 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-14 10:31:26,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-14 10:31:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 145. [2024-10-14 10:31:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:31:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 227 transitions. [2024-10-14 10:31:26,926 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 227 transitions. Word has length 201 [2024-10-14 10:31:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:26,927 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 227 transitions. [2024-10-14 10:31:26,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2024-10-14 10:31:26,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 10:31:26,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:26,929 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:26,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:27,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:27,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:27,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1175963288, now seen corresponding path program 1 times [2024-10-14 10:31:27,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:27,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097529923] [2024-10-14 10:31:27,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:27,132 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-14 10:31:27,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:27,133 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:27,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 10:31:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:27,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 10:31:27,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:30,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:30,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097529923] [2024-10-14 10:31:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097529923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:31:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627800712] [2024-10-14 10:31:30,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:31:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:31:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:31:30,277 INFO L87 Difference]: Start difference. First operand 145 states and 227 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:33,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:33,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:33,564 INFO L93 Difference]: Finished difference Result 235 states and 372 transitions. [2024-10-14 10:31:33,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:31:33,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 203 [2024-10-14 10:31:33,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:33,570 INFO L225 Difference]: With dead ends: 235 [2024-10-14 10:31:33,570 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 10:31:33,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 201 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-14 10:31:33,575 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 8 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:33,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 248 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 10:31:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 10:31:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2024-10-14 10:31:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 10:31:33,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2024-10-14 10:31:33,600 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 203 [2024-10-14 10:31:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:33,601 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2024-10-14 10:31:33,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:33,602 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2024-10-14 10:31:33,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-10-14 10:31:33,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:33,605 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:33,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:33,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:33,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:33,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash -992830461, now seen corresponding path program 1 times [2024-10-14 10:31:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:33,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839134769] [2024-10-14 10:31:33,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:33,808 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-14 10:31:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:33,811 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:33,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 10:31:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:34,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:31:34,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:31:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-14 10:31:35,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:31:35,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:31:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839134769] [2024-10-14 10:31:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839134769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:31:35,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:31:35,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:31:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291988473] [2024-10-14 10:31:35,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:31:35,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:31:35,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:31:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:31:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:31:35,316 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:38,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:40,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:31:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:31:40,930 INFO L93 Difference]: Finished difference Result 478 states and 758 transitions. [2024-10-14 10:31:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:31:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 205 [2024-10-14 10:31:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:31:40,935 INFO L225 Difference]: With dead ends: 478 [2024-10-14 10:31:40,935 INFO L226 Difference]: Without dead ends: 395 [2024-10-14 10:31:40,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:31:40,937 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 266 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:31:40,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 766 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-14 10:31:40,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-10-14 10:31:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 379. [2024-10-14 10:31:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 208 states have (on average 1.3125) internal successors, (273), 208 states have internal predecessors, (273), 165 states have call successors, (165), 5 states have call predecessors, (165), 5 states have return successors, (165), 165 states have call predecessors, (165), 165 states have call successors, (165) [2024-10-14 10:31:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 603 transitions. [2024-10-14 10:31:41,005 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 603 transitions. Word has length 205 [2024-10-14 10:31:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:31:41,006 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 603 transitions. [2024-10-14 10:31:41,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-14 10:31:41,006 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 603 transitions. [2024-10-14 10:31:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-14 10:31:41,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:31:41,009 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:31:41,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 10:31:41,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:31:41,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:31:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:31:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash 194070425, now seen corresponding path program 1 times [2024-10-14 10:31:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:31:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082587450] [2024-10-14 10:31:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:31:41,211 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-14 10:31:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:31:41,214 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:31:41,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 10:31:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:31:41,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-14 10:31:41,562 INFO L278 TraceCheckSpWp]: Computing forward predicates...