./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-pr-co_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 250383cbd2949bf39e846e0939c92bba0f3b87b7d8c235b8635e09f429144d36 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:54:17,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:54:17,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:54:17,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:54:17,921 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:54:17,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:54:17,952 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:54:17,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:54:17,953 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:54:17,953 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:54:17,954 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:54:17,954 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:54:17,955 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:54:17,957 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:54:17,957 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:54:17,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:54:17,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:54:17,958 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:54:17,959 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:54:17,959 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:54:17,959 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:54:17,960 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:54:17,960 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:54:17,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:54:17,961 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:54:17,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:54:17,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:54:17,962 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:54:17,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:54:17,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:54:17,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:54:17,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:54:17,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:17,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:54:17,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:54:17,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:54:17,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:54:17,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:54:17,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:54:17,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:54:17,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:54:17,967 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:54:17,967 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 250383cbd2949bf39e846e0939c92bba0f3b87b7d8c235b8635e09f429144d36 [2024-10-11 09:54:18,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:54:18,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:54:18,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:54:18,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:54:18,217 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:54:18,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:54:19,703 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:54:19,926 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:54:19,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:54:19,940 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ae572cd/f27a78e9a1dd446aa7664b40475008a6/FLAGe385dc212 [2024-10-11 09:54:20,280 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ae572cd/f27a78e9a1dd446aa7664b40475008a6 [2024-10-11 09:54:20,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:54:20,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:54:20,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:20,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:54:20,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:54:20,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210bc687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20, skipping insertion in model container [2024-10-11 09:54:20,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:54:20,504 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-pr-co_file-75.i[919,932] [2024-10-11 09:54:20,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:20,618 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:54:20,627 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-pr-co_file-75.i[919,932] [2024-10-11 09:54:20,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:20,708 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:54:20,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20 WrapperNode [2024-10-11 09:54:20,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:20,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:20,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:54:20,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:54:20,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,773 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 290 [2024-10-11 09:54:20,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:20,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:54:20,775 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:54:20,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:54:20,785 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,789 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,805 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:54:20,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,823 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:54:20,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:54:20,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:54:20,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:54:20,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (1/1) ... [2024-10-11 09:54:20,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:20,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:20,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:54:20,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:54:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:54:20,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:54:20,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:54:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:54:20,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:54:20,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:54:21,026 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:54:21,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:54:21,464 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:54:21,464 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:54:21,508 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:54:21,510 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:54:21,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:54:21 BoogieIcfgContainer [2024-10-11 09:54:21,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:54:21,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:54:21,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:54:21,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:54:21,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:54:20" (1/3) ... [2024-10-11 09:54:21,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bace145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:54:21, skipping insertion in model container [2024-10-11 09:54:21,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:20" (2/3) ... [2024-10-11 09:54:21,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bace145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:54:21, skipping insertion in model container [2024-10-11 09:54:21,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:54:21" (3/3) ... [2024-10-11 09:54:21,520 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:54:21,538 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:54:21,538 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:54:21,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:54:21,608 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;@aae35e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:54:21,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:54:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:54:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-11 09:54:21,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:21,636 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:21,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:21,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:21,643 INFO L85 PathProgramCache]: Analyzing trace with hash -317742813, now seen corresponding path program 1 times [2024-10-11 09:54:21,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:21,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535403673] [2024-10-11 09:54:21,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:21,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:21,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:21,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:21,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:21,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:22,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:22,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535403673] [2024-10-11 09:54:22,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535403673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:22,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:22,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:54:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732287480] [2024-10-11 09:54:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:54:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:22,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:54:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:54:22,200 INFO L87 Difference]: Start difference. First operand has 118 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:54:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:22,287 INFO L93 Difference]: Finished difference Result 232 states and 411 transitions. [2024-10-11 09:54:22,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:54:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 217 [2024-10-11 09:54:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:22,303 INFO L225 Difference]: With dead ends: 232 [2024-10-11 09:54:22,303 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 09:54:22,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:54:22,331 INFO L432 NwaCegarLoop]: 179 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, 179 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:22,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:54:22,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 09:54:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-11 09:54:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:54:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 182 transitions. [2024-10-11 09:54:22,396 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 182 transitions. Word has length 217 [2024-10-11 09:54:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:22,398 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 182 transitions. [2024-10-11 09:54:22,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:54:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 182 transitions. [2024-10-11 09:54:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-11 09:54:22,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:22,404 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:22,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:54:22,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:22,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:22,406 INFO L85 PathProgramCache]: Analyzing trace with hash 111350282, now seen corresponding path program 1 times [2024-10-11 09:54:22,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39482193] [2024-10-11 09:54:22,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:22,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:22,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:22,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:22,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39482193] [2024-10-11 09:54:22,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39482193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:22,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:22,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:54:22,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563594403] [2024-10-11 09:54:22,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:22,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:54:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:22,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:54:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:22,841 INFO L87 Difference]: Start difference. First operand 115 states and 182 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:23,043 INFO L93 Difference]: Finished difference Result 333 states and 530 transitions. [2024-10-11 09:54:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:54:23,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 218 [2024-10-11 09:54:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:23,052 INFO L225 Difference]: With dead ends: 333 [2024-10-11 09:54:23,054 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 09:54:23,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:23,056 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 152 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:23,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 392 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:54:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 09:54:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 210. [2024-10-11 09:54:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 139 states have (on average 1.3525179856115108) internal successors, (188), 139 states have internal predecessors, (188), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:54:23,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 324 transitions. [2024-10-11 09:54:23,107 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 324 transitions. Word has length 218 [2024-10-11 09:54:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:23,108 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 324 transitions. [2024-10-11 09:54:23,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 324 transitions. [2024-10-11 09:54:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-11 09:54:23,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:23,112 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:23,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:54:23,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:23,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:23,113 INFO L85 PathProgramCache]: Analyzing trace with hash -572857095, now seen corresponding path program 1 times [2024-10-11 09:54:23,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:23,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852758178] [2024-10-11 09:54:23,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:23,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:23,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:23,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852758178] [2024-10-11 09:54:23,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852758178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:23,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:23,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:54:23,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015954635] [2024-10-11 09:54:23,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:23,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:54:23,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:23,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:54:23,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:23,609 INFO L87 Difference]: Start difference. First operand 210 states and 324 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:23,727 INFO L93 Difference]: Finished difference Result 492 states and 763 transitions. [2024-10-11 09:54:23,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:54:23,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 219 [2024-10-11 09:54:23,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:23,734 INFO L225 Difference]: With dead ends: 492 [2024-10-11 09:54:23,734 INFO L226 Difference]: Without dead ends: 283 [2024-10-11 09:54:23,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:23,736 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 56 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:23,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 307 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:54:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-11 09:54:23,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 273. [2024-10-11 09:54:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 167 states have (on average 1.2994011976047903) internal successors, (217), 167 states have internal predecessors, (217), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 09:54:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 421 transitions. [2024-10-11 09:54:23,810 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 421 transitions. Word has length 219 [2024-10-11 09:54:23,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:23,811 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 421 transitions. [2024-10-11 09:54:23,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:23,812 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 421 transitions. [2024-10-11 09:54:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 09:54:23,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:23,815 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:23,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:54:23,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:23,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:23,817 INFO L85 PathProgramCache]: Analyzing trace with hash -942933999, now seen corresponding path program 1 times [2024-10-11 09:54:23,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:23,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542587698] [2024-10-11 09:54:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:24,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:24,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542587698] [2024-10-11 09:54:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542587698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:54:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865837747] [2024-10-11 09:54:24,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:24,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:54:24,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:24,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:54:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:54:24,267 INFO L87 Difference]: Start difference. First operand 273 states and 421 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:24,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:24,588 INFO L93 Difference]: Finished difference Result 700 states and 1081 transitions. [2024-10-11 09:54:24,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:54:24,589 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 09:54:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:24,597 INFO L225 Difference]: With dead ends: 700 [2024-10-11 09:54:24,597 INFO L226 Difference]: Without dead ends: 491 [2024-10-11 09:54:24,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-11 09:54:24,602 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 296 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:24,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 512 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:54:24,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-11 09:54:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 480. [2024-10-11 09:54:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 304 states have (on average 1.3223684210526316) internal successors, (402), 304 states have internal predecessors, (402), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 09:54:24,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 742 transitions. [2024-10-11 09:54:24,698 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 742 transitions. Word has length 220 [2024-10-11 09:54:24,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:24,699 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 742 transitions. [2024-10-11 09:54:24,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 742 transitions. [2024-10-11 09:54:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-10-11 09:54:24,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:24,704 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:54:24,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:24,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash 68183251, now seen corresponding path program 1 times [2024-10-11 09:54:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93791379] [2024-10-11 09:54:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:24,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:25,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:25,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:25,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:25,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93791379] [2024-10-11 09:54:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93791379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:25,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:25,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:54:25,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802834427] [2024-10-11 09:54:25,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:25,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:54:25,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:25,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:54:25,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:54:25,268 INFO L87 Difference]: Start difference. First operand 480 states and 742 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:25,528 INFO L93 Difference]: Finished difference Result 907 states and 1406 transitions. [2024-10-11 09:54:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:54:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 220 [2024-10-11 09:54:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:25,534 INFO L225 Difference]: With dead ends: 907 [2024-10-11 09:54:25,534 INFO L226 Difference]: Without dead ends: 491 [2024-10-11 09:54:25,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:54:25,537 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 56 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:25,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 395 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:54:25,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-10-11 09:54:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 482. [2024-10-11 09:54:25,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 306 states have (on average 1.3235294117647058) internal successors, (405), 306 states have internal predecessors, (405), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 09:54:25,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 745 transitions. [2024-10-11 09:54:25,604 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 745 transitions. Word has length 220 [2024-10-11 09:54:25,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:25,605 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 745 transitions. [2024-10-11 09:54:25,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:25,605 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 745 transitions. [2024-10-11 09:54:25,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:54:25,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:25,608 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:25,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 09:54:25,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:25,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:25,609 INFO L85 PathProgramCache]: Analyzing trace with hash -595872968, now seen corresponding path program 1 times [2024-10-11 09:54:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:25,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401740828] [2024-10-11 09:54:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:25,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:25,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401740828] [2024-10-11 09:54:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401740828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:25,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:54:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200791750] [2024-10-11 09:54:25,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:25,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:54:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:25,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:54:25,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:25,860 INFO L87 Difference]: Start difference. First operand 482 states and 745 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:25,924 INFO L93 Difference]: Finished difference Result 898 states and 1389 transitions. [2024-10-11 09:54:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:54:25,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2024-10-11 09:54:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:25,929 INFO L225 Difference]: With dead ends: 898 [2024-10-11 09:54:25,930 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 09:54:25,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:25,932 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:25,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:54:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 09:54:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2024-10-11 09:54:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 306 states have (on average 1.3169934640522876) internal successors, (403), 306 states have internal predecessors, (403), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-11 09:54:25,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 743 transitions. [2024-10-11 09:54:25,984 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 743 transitions. Word has length 221 [2024-10-11 09:54:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:25,984 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 743 transitions. [2024-10-11 09:54:25,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 743 transitions. [2024-10-11 09:54:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:54:25,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:25,988 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:25,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 09:54:25,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:25,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1640254368, now seen corresponding path program 1 times [2024-10-11 09:54:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:25,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437572892] [2024-10-11 09:54:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:26,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437572892] [2024-10-11 09:54:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437572892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:26,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:26,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:54:26,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82909615] [2024-10-11 09:54:26,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:26,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:54:26,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:54:26,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:54:26,306 INFO L87 Difference]: Start difference. First operand 482 states and 743 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:26,698 INFO L93 Difference]: Finished difference Result 1006 states and 1553 transitions. [2024-10-11 09:54:26,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:54:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2024-10-11 09:54:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:26,705 INFO L225 Difference]: With dead ends: 1006 [2024-10-11 09:54:26,705 INFO L226 Difference]: Without dead ends: 590 [2024-10-11 09:54:26,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 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-11 09:54:26,708 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 267 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:26,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 509 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:54:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-10-11 09:54:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 576. [2024-10-11 09:54:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 365 states have (on average 1.3095890410958904) internal successors, (478), 365 states have internal predecessors, (478), 204 states have call successors, (204), 6 states have call predecessors, (204), 6 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2024-10-11 09:54:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 886 transitions. [2024-10-11 09:54:26,770 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 886 transitions. Word has length 221 [2024-10-11 09:54:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:26,771 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 886 transitions. [2024-10-11 09:54:26,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 886 transitions. [2024-10-11 09:54:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-11 09:54:26,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:26,774 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:26,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 09:54:26,776 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:26,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1643595678, now seen corresponding path program 1 times [2024-10-11 09:54:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646099044] [2024-10-11 09:54:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:27,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646099044] [2024-10-11 09:54:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646099044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:27,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:27,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:54:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050030452] [2024-10-11 09:54:27,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:27,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:54:27,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:54:27,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:27,034 INFO L87 Difference]: Start difference. First operand 576 states and 886 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:27,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:27,145 INFO L93 Difference]: Finished difference Result 1086 states and 1671 transitions. [2024-10-11 09:54:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:54:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 221 [2024-10-11 09:54:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:27,151 INFO L225 Difference]: With dead ends: 1086 [2024-10-11 09:54:27,151 INFO L226 Difference]: Without dead ends: 576 [2024-10-11 09:54:27,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:54:27,154 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:27,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 310 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:54:27,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-11 09:54:27,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2024-10-11 09:54:27,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 365 states have (on average 1.3041095890410959) internal successors, (476), 365 states have internal predecessors, (476), 204 states have call successors, (204), 6 states have call predecessors, (204), 6 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2024-10-11 09:54:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 884 transitions. [2024-10-11 09:54:27,207 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 884 transitions. Word has length 221 [2024-10-11 09:54:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:27,208 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 884 transitions. [2024-10-11 09:54:27,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 09:54:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 884 transitions. [2024-10-11 09:54:27,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 09:54:27,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:27,211 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:27,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 09:54:27,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:27,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:27,212 INFO L85 PathProgramCache]: Analyzing trace with hash -161409223, now seen corresponding path program 1 times [2024-10-11 09:54:27,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:27,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845246996] [2024-10-11 09:54:27,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:27,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:27,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845246996] [2024-10-11 09:54:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845246996] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:54:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166988255] [2024-10-11 09:54:27,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:27,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:27,660 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:54:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:54:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:27,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 09:54:27,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:28,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-11 09:54:28,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:54:28,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:28,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166988255] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:54:28,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:54:28,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-10-11 09:54:28,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005842154] [2024-10-11 09:54:28,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:54:28,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 09:54:28,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:28,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 09:54:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:54:28,482 INFO L87 Difference]: Start difference. First operand 576 states and 884 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-10-11 09:54:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:29,438 INFO L93 Difference]: Finished difference Result 829 states and 1274 transitions. [2024-10-11 09:54:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 09:54:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 222 [2024-10-11 09:54:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:29,442 INFO L225 Difference]: With dead ends: 829 [2024-10-11 09:54:29,442 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 09:54:29,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2024-10-11 09:54:29,445 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 336 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:29,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 446 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:54:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 09:54:29,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 188. [2024-10-11 09:54:29,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 115 states have (on average 1.2260869565217392) internal successors, (141), 115 states have internal predecessors, (141), 68 states have call successors, (68), 4 states have call predecessors, (68), 4 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-11 09:54:29,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 277 transitions. [2024-10-11 09:54:29,473 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 277 transitions. Word has length 222 [2024-10-11 09:54:29,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:29,474 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 277 transitions. [2024-10-11 09:54:29,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-10-11 09:54:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 277 transitions. [2024-10-11 09:54:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 09:54:29,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:29,477 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:29,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 09:54:29,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:29,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -835431268, now seen corresponding path program 1 times [2024-10-11 09:54:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493736809] [2024-10-11 09:54:29,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 09:54:30,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:30,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493736809] [2024-10-11 09:54:30,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493736809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:54:30,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:54:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 09:54:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472351416] [2024-10-11 09:54:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:54:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 09:54:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:30,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 09:54:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:54:30,529 INFO L87 Difference]: Start difference. First operand 188 states and 277 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:54:31,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:31,248 INFO L93 Difference]: Finished difference Result 571 states and 827 transitions. [2024-10-11 09:54:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:54:31,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 224 [2024-10-11 09:54:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:31,252 INFO L225 Difference]: With dead ends: 571 [2024-10-11 09:54:31,253 INFO L226 Difference]: Without dead ends: 453 [2024-10-11 09:54:31,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:54:31,254 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 553 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:31,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 584 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 09:54:31,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-10-11 09:54:31,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 445. [2024-10-11 09:54:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 294 states have (on average 1.248299319727891) internal successors, (367), 296 states have internal predecessors, (367), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-10-11 09:54:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 647 transitions. [2024-10-11 09:54:31,328 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 647 transitions. Word has length 224 [2024-10-11 09:54:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:31,328 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 647 transitions. [2024-10-11 09:54:31,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:54:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 647 transitions. [2024-10-11 09:54:31,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 09:54:31,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:31,331 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:31,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 09:54:31,331 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:31,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:31,332 INFO L85 PathProgramCache]: Analyzing trace with hash -778172966, now seen corresponding path program 1 times [2024-10-11 09:54:31,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639086177] [2024-10-11 09:54:31,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:31,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:31,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639086177] [2024-10-11 09:54:31,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639086177] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:54:31,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749165672] [2024-10-11 09:54:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:31,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:54:31,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:54:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:32,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 09:54:32,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-11 09:54:33,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:54:36,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:36,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749165672] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:54:36,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:54:36,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 12] total 25 [2024-10-11 09:54:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812838379] [2024-10-11 09:54:36,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:54:36,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 09:54:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 09:54:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2024-10-11 09:54:36,287 INFO L87 Difference]: Start difference. First operand 445 states and 647 transitions. Second operand has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2024-10-11 09:54:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:43,087 INFO L93 Difference]: Finished difference Result 1341 states and 1941 transitions. [2024-10-11 09:54:43,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-10-11 09:54:43,087 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) Word has length 224 [2024-10-11 09:54:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:43,096 INFO L225 Difference]: With dead ends: 1341 [2024-10-11 09:54:43,097 INFO L226 Difference]: Without dead ends: 858 [2024-10-11 09:54:43,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1317, Invalid=5163, Unknown=0, NotChecked=0, Total=6480 [2024-10-11 09:54:43,100 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1421 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 4102 mSolverCounterSat, 1005 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1490 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 5107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1005 IncrementalHoareTripleChecker+Valid, 4102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:43,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1490 Valid, 2366 Invalid, 5107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1005 Valid, 4102 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 09:54:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-10-11 09:54:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 663. [2024-10-11 09:54:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 437 states have (on average 1.2356979405034325) internal successors, (540), 440 states have internal predecessors, (540), 208 states have call successors, (208), 17 states have call predecessors, (208), 17 states have return successors, (208), 205 states have call predecessors, (208), 208 states have call successors, (208) [2024-10-11 09:54:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 956 transitions. [2024-10-11 09:54:43,209 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 956 transitions. Word has length 224 [2024-10-11 09:54:43,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:43,209 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 956 transitions. [2024-10-11 09:54:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 6 states have call successors, (102), 3 states have call predecessors, (102), 6 states have return successors, (102), 6 states have call predecessors, (102), 6 states have call successors, (102) [2024-10-11 09:54:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 956 transitions. [2024-10-11 09:54:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 09:54:43,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:43,212 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:43,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:54:43,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:43,417 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:43,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash 232944284, now seen corresponding path program 1 times [2024-10-11 09:54:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:43,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485975761] [2024-10-11 09:54:43,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:43,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:54:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:54:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:54:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 09:54:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:54:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 09:54:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:54:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 09:54:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:54:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 09:54:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:54:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 09:54:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 09:54:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 09:54:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 09:54:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 09:54:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 09:54:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 09:54:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 09:54:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 09:54:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 09:54:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 09:54:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 09:54:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 09:54:43,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 09:54:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 09:54:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 09:54:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 09:54:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-11 09:54:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-10-11 09:54:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 09:54:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-10-11 09:54:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 09:54:43,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-11 09:54:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:43,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:54:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485975761] [2024-10-11 09:54:43,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485975761] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:54:43,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390427068] [2024-10-11 09:54:43,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:43,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:43,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:43,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:54:43,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 09:54:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:54:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:54:44,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:54:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-10-11 09:54:44,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:54:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-10-11 09:54:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390427068] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:54:44,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:54:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-11 09:54:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520366176] [2024-10-11 09:54:44,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:54:44,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 09:54:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:54:44,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 09:54:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-11 09:54:44,594 INFO L87 Difference]: Start difference. First operand 663 states and 956 transitions. Second operand has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-10-11 09:54:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:54:45,555 INFO L93 Difference]: Finished difference Result 1291 states and 1855 transitions. [2024-10-11 09:54:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 09:54:45,556 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) Word has length 224 [2024-10-11 09:54:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:54:45,561 INFO L225 Difference]: With dead ends: 1291 [2024-10-11 09:54:45,562 INFO L226 Difference]: Without dead ends: 698 [2024-10-11 09:54:45,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=403, Unknown=0, NotChecked=0, Total=552 [2024-10-11 09:54:45,564 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 369 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:54:45,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 798 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:54:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-11 09:54:45,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 663. [2024-10-11 09:54:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 437 states have (on average 1.2265446224256293) internal successors, (536), 440 states have internal predecessors, (536), 208 states have call successors, (208), 17 states have call predecessors, (208), 17 states have return successors, (208), 205 states have call predecessors, (208), 208 states have call successors, (208) [2024-10-11 09:54:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 952 transitions. [2024-10-11 09:54:45,710 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 952 transitions. Word has length 224 [2024-10-11 09:54:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:54:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 952 transitions. [2024-10-11 09:54:45,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 3 states have call successors, (70), 2 states have call predecessors, (70), 4 states have return successors, (71), 3 states have call predecessors, (71), 3 states have call successors, (71) [2024-10-11 09:54:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 952 transitions. [2024-10-11 09:54:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 09:54:45,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:54:45,713 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:45,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 09:54:45,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:45,914 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:54:45,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:54:45,915 INFO L85 PathProgramCache]: Analyzing trace with hash -217546701, now seen corresponding path program 1 times [2024-10-11 09:54:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:54:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749528065] [2024-10-11 09:54:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:54:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:54:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564939952] [2024-10-11 09:54:45,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:54:45,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:54:46,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:46,001 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:54:46,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 09:54:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:54:46,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:54:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:54:46,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:54:46,545 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:54:46,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:54:46,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 09:54:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-11 09:54:46,751 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:54:46,913 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:54:46,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:54:46 BoogieIcfgContainer [2024-10-11 09:54:46,918 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:54:46,919 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:54:46,919 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:54:46,919 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:54:46,920 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:54:21" (3/4) ... [2024-10-11 09:54:46,922 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:54:46,923 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:54:46,924 INFO L158 Benchmark]: Toolchain (without parser) took 26639.07ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 114.2MB in the beginning and 369.0MB in the end (delta: -254.8MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,924 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:54:46,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.50ms. Allocated memory is still 186.6MB. Free memory was 114.0MB in the beginning and 151.8MB in the end (delta: -37.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.05ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 148.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,924 INFO L158 Benchmark]: Boogie Preprocessor took 53.60ms. Allocated memory is still 186.6MB. Free memory was 148.2MB in the beginning and 144.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,925 INFO L158 Benchmark]: RCFGBuilder took 682.03ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 112.5MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,925 INFO L158 Benchmark]: TraceAbstraction took 25405.08ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 111.9MB in the beginning and 370.1MB in the end (delta: -258.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,926 INFO L158 Benchmark]: Witness Printer took 4.34ms. Allocated memory is still 515.9MB. Free memory was 370.1MB in the beginning and 369.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 09:54:46,927 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 72.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 423.50ms. Allocated memory is still 186.6MB. Free memory was 114.0MB in the beginning and 151.8MB in the end (delta: -37.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.05ms. Allocated memory is still 186.6MB. Free memory was 151.8MB in the beginning and 148.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.60ms. Allocated memory is still 186.6MB. Free memory was 148.2MB in the beginning and 144.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 682.03ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 112.5MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 25405.08ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 111.9MB in the beginning and 370.1MB in the end (delta: -258.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 4.34ms. Allocated memory is still 515.9MB. Free memory was 370.1MB in the beginning and 369.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 201, overapproximation of bitwiseOr at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 201, overapproximation of someUnaryFLOAToperation at line 102, overapproximation of someBinaryArithmeticFLOAToperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] float var_1_33 = 10.775; [L47] float var_1_36 = 9999.1; [L48] float var_1_37 = 64.625; [L49] float var_1_38 = 7.5; [L50] float var_1_40 = 8.25; [L51] unsigned long int var_1_41 = 256; [L52] unsigned long int var_1_44 = 64; [L53] unsigned long int var_1_45 = 64; [L54] double var_1_46 = 31.1; [L55] signed char var_1_47 = 50; [L56] signed char var_1_48 = 16; [L57] double last_1_var_1_22 = 200.8; [L205] isInitial = 1 [L206] FCALL initially() [L207] COND TRUE 1 [L208] CALL updateLastVariables() [L198] last_1_var_1_22 = var_1_22 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L140] var_1_4 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L141] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L143] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] var_1_11 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] var_1_12 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] var_1_13 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_14 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] var_1_17 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] var_1_23 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_24 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L171] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L172] var_1_28 = __VERIFIER_nondet_short() [L173] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L173] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L174] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L174] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L175] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L175] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=0, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L176] var_1_31 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L177] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L178] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L178] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L179] var_1_32 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L180] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L181] CALL assume_abort_if_not(var_1_32 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L181] RET assume_abort_if_not(var_1_32 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=99991/10, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L182] var_1_36 = __VERIFIER_nondet_float() [L183] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L183] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_37=517/8, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L184] var_1_37 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L185] RET assume_abort_if_not((var_1_37 >= -922337.2036854765600e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_38=15/2, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L186] var_1_38 = __VERIFIER_nondet_float() [L187] CALL assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L187] RET assume_abort_if_not((var_1_38 >= -922337.2036854765600e+13F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 9223372.036854765600e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_40=33/4, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L188] var_1_40 = __VERIFIER_nondet_float() [L189] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L189] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=64, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L190] var_1_44 = __VERIFIER_nondet_ulong() [L191] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L191] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L192] CALL assume_abort_if_not(var_1_44 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L192] RET assume_abort_if_not(var_1_44 <= 4294967294) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L193] var_1_48 = __VERIFIER_nondet_char() [L194] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L194] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L195] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L195] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L209] RET updateVariables() [L210] CALL step() [L61] COND TRUE ! (var_1_4 < 16.8f) [L62] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L64] EXPR var_1_25 ^ (var_1_28 + var_1_21) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L64] COND FALSE !((var_1_25 ^ (var_1_28 + var_1_21)) <= (((((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21))) < 0 ) ? -((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21))) : ((((var_1_21) < (var_1_21)) ? (var_1_21) : (var_1_21)))))) [L67] COND FALSE !(var_1_38 >= ((((var_1_37) > ((var_1_36 * var_1_15))) ? (var_1_37) : ((var_1_36 * var_1_15))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L73] COND FALSE !(\read(var_1_32)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L82] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L83] EXPR var_1_25 & var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L83] COND TRUE (var_1_25 & var_1_25) <= var_1_25 [L84] COND FALSE !(var_1_38 <= var_1_1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L92] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L92] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L92] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L92] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L92] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L93] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L101] COND TRUE var_1_25 != var_1_21 [L102] var_1_46 = ((((((((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) < 0 ) ? -((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) : ((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))))) < 0 ) ? -(((((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) < 0 ) ? -((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) : ((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))))) : (((((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) < 0 ) ? -((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))) : ((((var_1_37) < (var_1_36)) ? (var_1_37) : (var_1_36))))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L106] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L109] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L110] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L115] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L116] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L123] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=4, var_1_21=1, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=64, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L125] var_1_45 = var_1_44 [L126] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=4, var_1_21=1, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L127] COND TRUE stepLocal_0 || var_1_7 [L128] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=1, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L130] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L131] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=50, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L133] COND FALSE !((var_1_21 % var_1_28) >= var_1_25) [L136] var_1_26 = (var_1_7 && (var_1_31 && var_1_32)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=50, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L210] RET step() [L211] CALL, EXPR property() [L201] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=50, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L201-L202] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=50, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=4, var_1_21=50, var_1_22=4, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-1, var_1_31=1, var_1_32=0, var_1_33=431/40, var_1_36=0, var_1_37=0, var_1_41=256, var_1_44=0, var_1_45=0, var_1_46=3, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 13, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3593 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3506 mSDsluCounter, 7149 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4582 mSDsCounter, 1522 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6820 IncrementalHoareTripleChecker+Invalid, 8342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1522 mSolverCounterUnsat, 2567 mSDtfsCounter, 6820 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2329 GetRequests, 2187 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=11, InterpolantAutomatonStates: 129, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 422 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 3777 NumberOfCodeBlocks, 3777 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3973 ConstructedInterpolants, 0 QuantifiedInterpolants, 13897 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1469 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 18 InterpolantComputations, 9 PerfectInterpolantSequences, 39906/40392 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:54:47,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 250383cbd2949bf39e846e0939c92bba0f3b87b7d8c235b8635e09f429144d36 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:54:49,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:54:49,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:54:49,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:54:49,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:54:49,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:54:49,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:54:49,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:54:49,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:54:49,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:54:49,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:54:49,344 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:54:49,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:54:49,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:54:49,347 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:54:49,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:54:49,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:54:49,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:54:49,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:54:49,352 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:54:49,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:54:49,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:54:49,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:54:49,353 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:54:49,353 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:54:49,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:54:49,353 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:54:49,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:54:49,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:54:49,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:54:49,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:54:49,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:54:49,355 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:54:49,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:54:49,355 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:49,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:54:49,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:54:49,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:54:49,357 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:54:49,357 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:54:49,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:54:49,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:54:49,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:54:49,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:54:49,359 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:54:49,359 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 250383cbd2949bf39e846e0939c92bba0f3b87b7d8c235b8635e09f429144d36 [2024-10-11 09:54:49,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:54:49,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:54:49,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:54:49,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:54:49,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:54:49,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:54:51,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:54:51,470 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:54:51,471 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:54:51,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77c4edc34/e85db416b88c42c0b107fe4f78b5bfde/FLAG7a31b3525 [2024-10-11 09:54:51,497 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/77c4edc34/e85db416b88c42c0b107fe4f78b5bfde [2024-10-11 09:54:51,500 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:54:51,501 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:54:51,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:51,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:54:51,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:54:51,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:51,523 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b6c48f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51, skipping insertion in model container [2024-10-11 09:54:51,523 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:51,560 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:54:51,732 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-pr-co_file-75.i[919,932] [2024-10-11 09:54:51,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:51,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:54:51,850 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-pr-co_file-75.i[919,932] [2024-10-11 09:54:51,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:54:51,927 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:54:51,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51 WrapperNode [2024-10-11 09:54:51,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:54:51,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:51,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:54:51,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:54:51,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:51,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,008 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 217 [2024-10-11 09:54:52,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:54:52,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:54:52,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:54:52,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:54:52,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,051 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:54:52,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:54:52,095 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:54:52,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:54:52,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:54:52,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (1/1) ... [2024-10-11 09:54:52,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:54:52,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:54:52,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:54:52,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:54:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:54:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:54:52,176 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:54:52,176 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:54:52,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:54:52,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:54:52,269 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:54:52,272 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:55:10,557 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 09:55:10,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:55:10,627 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:55:10,627 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:55:10,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:55:10 BoogieIcfgContainer [2024-10-11 09:55:10,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:55:10,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:55:10,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:55:10,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:55:10,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:54:51" (1/3) ... [2024-10-11 09:55:10,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c7ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:55:10, skipping insertion in model container [2024-10-11 09:55:10,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:54:51" (2/3) ... [2024-10-11 09:55:10,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775c7ac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:55:10, skipping insertion in model container [2024-10-11 09:55:10,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:55:10" (3/3) ... [2024-10-11 09:55:10,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-75.i [2024-10-11 09:55:10,657 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:55:10,657 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:55:10,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:55:10,743 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;@b284901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:55:10,743 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:55:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:55:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 09:55:10,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:55:10,767 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:55:10,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:55:10,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:55:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 724766520, now seen corresponding path program 1 times [2024-10-11 09:55:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:55:10,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860848366] [2024-10-11 09:55:10,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:55:10,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:55:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:55:10,796 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:55:10,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:55:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:55:11,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:55:11,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:55:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2024-10-11 09:55:11,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:55:11,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:55:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860848366] [2024-10-11 09:55:11,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860848366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:55:11,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:55:11,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:55:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499925791] [2024-10-11 09:55:11,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:55:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:55:11,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:55:11,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:55:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:55:11,682 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:55:15,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:55:15,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:55:15,966 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2024-10-11 09:55:16,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:55:16,045 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2024-10-11 09:55:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:55:16,052 INFO L225 Difference]: With dead ends: 181 [2024-10-11 09:55:16,052 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 09:55:16,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:55:16,058 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:55:16,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 09:55:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 09:55:16,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 09:55:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 09:55:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-10-11 09:55:16,110 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 211 [2024-10-11 09:55:16,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:55:16,111 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-10-11 09:55:16,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 09:55:16,111 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-10-11 09:55:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-11 09:55:16,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:55:16,115 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:55:16,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:55:16,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:55:16,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:55:16,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:55:16,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1024473471, now seen corresponding path program 1 times [2024-10-11 09:55:16,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:55:16,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1555832775] [2024-10-11 09:55:16,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:55:16,319 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:55:16,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:55:16,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:55:16,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:55:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:55:17,172 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 09:55:17,193 INFO L278 TraceCheckSpWp]: Computing forward predicates...