./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:29:13,865 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:29:13,926 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:29:13,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:29:13,932 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:29:13,960 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:29:13,961 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:29:13,961 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:29:13,962 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:29:13,962 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:29:13,962 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:29:13,963 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:29:13,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:29:13,967 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:29:13,967 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:29:13,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:29:13,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:29:13,968 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:29:13,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:29:13,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:29:13,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:29:13,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:29:13,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:29:13,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:29:13,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:29:13,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:29:13,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:29:13,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:29:13,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:29:13,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:29:13,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:29:13,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:29:13,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:13,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:29:13,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:29:13,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:29:13,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:29:13,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:29:13,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:29:13,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:29:13,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:29:13,977 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:29:13,977 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2024-11-09 00:29:14,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:29:14,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:29:14,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:29:14,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:29:14,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:29:14,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-09 00:29:15,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:29:15,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:29:15,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-09 00:29:15,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2900c7eed/c4c3f63d89ce49dd84a9d3ab5364eb25/FLAGf751512a5 [2024-11-09 00:29:15,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2900c7eed/c4c3f63d89ce49dd84a9d3ab5364eb25 [2024-11-09 00:29:15,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:29:15,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:29:15,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:15,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:29:15,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:29:15,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:15" (1/1) ... [2024-11-09 00:29:15,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff0cad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:15, skipping insertion in model container [2024-11-09 00:29:15,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:15" (1/1) ... [2024-11-09 00:29:15,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:29:16,033 WARN L250 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_operatoramount_amount100_file-80.i[916,929] [2024-11-09 00:29:16,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:16,109 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:29:16,121 WARN L250 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_operatoramount_amount100_file-80.i[916,929] [2024-11-09 00:29:16,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:16,177 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:29:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16 WrapperNode [2024-11-09 00:29:16,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:16,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:16,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:29:16,179 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:29:16,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,195 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,227 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-11-09 00:29:16,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:16,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:29:16,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:29:16,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:29:16,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,265 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-11-09 00:29:16,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:29:16,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:29:16,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:29:16,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:29:16,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (1/1) ... [2024-11-09 00:29:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:16,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:16,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:29:16,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:29:16,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:29:16,361 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:29:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:29:16,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:29:16,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:29:16,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:29:16,510 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:29:16,513 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:29:16,908 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-09 00:29:16,909 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:29:16,925 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:29:16,928 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:29:16,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:16 BoogieIcfgContainer [2024-11-09 00:29:16,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:29:16,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:29:16,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:29:16,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:29:16,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:29:15" (1/3) ... [2024-11-09 00:29:16,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ae6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:29:16, skipping insertion in model container [2024-11-09 00:29:16,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:16" (2/3) ... [2024-11-09 00:29:16,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ae6d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:29:16, skipping insertion in model container [2024-11-09 00:29:16,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:16" (3/3) ... [2024-11-09 00:29:16,937 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-09 00:29:16,952 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:29:16,952 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:29:17,018 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:29:17,025 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;@a22a292, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:29:17,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:29:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:29:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 00:29:17,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:17,047 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:17,048 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:17,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash 602409142, now seen corresponding path program 1 times [2024-11-09 00:29:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:17,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463314473] [2024-11-09 00:29:17,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:17,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:17,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:17,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:17,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463314473] [2024-11-09 00:29:17,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463314473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:17,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:17,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:29:17,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473257718] [2024-11-09 00:29:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:29:17,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:29:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:29:17,499 INFO L87 Difference]: Start difference. First operand has 103 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 78 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:17,532 INFO L93 Difference]: Finished difference Result 199 states and 337 transitions. [2024-11-09 00:29:17,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:29:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2024-11-09 00:29:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:17,543 INFO L225 Difference]: With dead ends: 199 [2024-11-09 00:29:17,543 INFO L226 Difference]: Without dead ends: 99 [2024-11-09 00:29:17,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-11-09 00:29:17,550 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:17,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:29:17,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-09 00:29:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-09 00:29:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:29:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 153 transitions. [2024-11-09 00:29:17,598 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 153 transitions. Word has length 161 [2024-11-09 00:29:17,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:17,599 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 153 transitions. [2024-11-09 00:29:17,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2024-11-09 00:29:17,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-09 00:29:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:17,604 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:29:17,605 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:17,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:17,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1521201364, now seen corresponding path program 1 times [2024-11-09 00:29:17,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:17,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190186443] [2024-11-09 00:29:17,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:17,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:17,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:17,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190186443] [2024-11-09 00:29:17,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190186443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:17,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:29:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107828105] [2024-11-09 00:29:17,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:29:17,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:29:17,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:29:17,970 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:18,044 INFO L93 Difference]: Finished difference Result 245 states and 376 transitions. [2024-11-09 00:29:18,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:29:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-11-09 00:29:18,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:18,047 INFO L225 Difference]: With dead ends: 245 [2024-11-09 00:29:18,047 INFO L226 Difference]: Without dead ends: 149 [2024-11-09 00:29:18,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-11-09 00:29:18,050 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 77 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:18,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 270 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:29:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-09 00:29:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2024-11-09 00:29:18,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 118 states have (on average 1.4491525423728813) internal successors, (171), 119 states have internal predecessors, (171), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:29:18,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2024-11-09 00:29:18,077 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 161 [2024-11-09 00:29:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:18,077 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2024-11-09 00:29:18,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2024-11-09 00:29:18,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:29:18,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:18,082 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:18,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:29:18,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:18,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:18,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1195834440, now seen corresponding path program 1 times [2024-11-09 00:29:18,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:18,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350526430] [2024-11-09 00:29:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:18,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:18,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:18,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:18,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350526430] [2024-11-09 00:29:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350526430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:18,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:18,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:29:18,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081372811] [2024-11-09 00:29:18,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:18,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:29:18,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:18,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:29:18,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:29:18,860 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:19,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:19,577 INFO L93 Difference]: Finished difference Result 608 states and 918 transitions. [2024-11-09 00:29:19,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:29:19,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-09 00:29:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:19,582 INFO L225 Difference]: With dead ends: 608 [2024-11-09 00:29:19,582 INFO L226 Difference]: Without dead ends: 465 [2024-11-09 00:29:19,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:29:19,584 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 435 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 435 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:19,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [435 Valid, 586 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:29:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-09 00:29:19,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 367. [2024-11-09 00:29:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 287 states have (on average 1.4355400696864111) internal successors, (412), 290 states have internal predecessors, (412), 73 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (73), 70 states have call predecessors, (73), 73 states have call successors, (73) [2024-11-09 00:29:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 558 transitions. [2024-11-09 00:29:19,664 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 558 transitions. Word has length 162 [2024-11-09 00:29:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:19,664 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 558 transitions. [2024-11-09 00:29:19,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 558 transitions. [2024-11-09 00:29:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:29:19,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:19,667 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:19,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:29:19,667 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:19,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:19,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2088015606, now seen corresponding path program 1 times [2024-11-09 00:29:19,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:19,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432113254] [2024-11-09 00:29:19,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:20,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:20,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432113254] [2024-11-09 00:29:20,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432113254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:20,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:20,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:29:20,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985036525] [2024-11-09 00:29:20,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:20,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:29:20,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:20,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:29:20,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:29:20,263 INFO L87 Difference]: Start difference. First operand 367 states and 558 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:20,902 INFO L93 Difference]: Finished difference Result 1525 states and 2326 transitions. [2024-11-09 00:29:20,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:29:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-09 00:29:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:20,908 INFO L225 Difference]: With dead ends: 1525 [2024-11-09 00:29:20,909 INFO L226 Difference]: Without dead ends: 1161 [2024-11-09 00:29:20,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:29:20,911 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 680 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:20,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 975 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:29:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2024-11-09 00:29:20,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 565. [2024-11-09 00:29:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 460 states have (on average 1.4565217391304348) internal successors, (670), 463 states have internal predecessors, (670), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 862 transitions. [2024-11-09 00:29:20,972 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 862 transitions. Word has length 162 [2024-11-09 00:29:20,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 862 transitions. [2024-11-09 00:29:20,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 862 transitions. [2024-11-09 00:29:20,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:29:20,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:20,975 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:20,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:29:20,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:20,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1954002100, now seen corresponding path program 1 times [2024-11-09 00:29:20,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:20,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18665234] [2024-11-09 00:29:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:20,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:21,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:21,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:21,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:21,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18665234] [2024-11-09 00:29:21,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18665234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:21,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 00:29:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588003492] [2024-11-09 00:29:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:21,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:29:21,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:21,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:29:21,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:29:21,313 INFO L87 Difference]: Start difference. First operand 565 states and 862 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:22,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:22,109 INFO L93 Difference]: Finished difference Result 1579 states and 2399 transitions. [2024-11-09 00:29:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 00:29:22,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-11-09 00:29:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:22,116 INFO L225 Difference]: With dead ends: 1579 [2024-11-09 00:29:22,117 INFO L226 Difference]: Without dead ends: 1215 [2024-11-09 00:29:22,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:29:22,119 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 429 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 888 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:22,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 888 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:29:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2024-11-09 00:29:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 644. [2024-11-09 00:29:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4749536178107607) internal successors, (795), 542 states have internal predecessors, (795), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:22,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 987 transitions. [2024-11-09 00:29:22,214 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 987 transitions. Word has length 162 [2024-11-09 00:29:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:22,214 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 987 transitions. [2024-11-09 00:29:22,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 987 transitions. [2024-11-09 00:29:22,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 00:29:22,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:22,217 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:22,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:29:22,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:22,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1578542516, now seen corresponding path program 1 times [2024-11-09 00:29:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794357550] [2024-11-09 00:29:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:22,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794357550] [2024-11-09 00:29:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794357550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:29:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103586666] [2024-11-09 00:29:22,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:22,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:29:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:22,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:29:22,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:29:22,703 INFO L87 Difference]: Start difference. First operand 644 states and 987 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:23,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:23,293 INFO L93 Difference]: Finished difference Result 1634 states and 2502 transitions. [2024-11-09 00:29:23,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:29:23,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-11-09 00:29:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:23,298 INFO L225 Difference]: With dead ends: 1634 [2024-11-09 00:29:23,298 INFO L226 Difference]: Without dead ends: 1191 [2024-11-09 00:29:23,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:29:23,300 INFO L432 NwaCegarLoop]: 218 mSDtfsCounter, 333 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:23,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1025 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:29:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2024-11-09 00:29:23,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 644. [2024-11-09 00:29:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4749536178107607) internal successors, (795), 542 states have internal predecessors, (795), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 987 transitions. [2024-11-09 00:29:23,361 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 987 transitions. Word has length 162 [2024-11-09 00:29:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:23,362 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 987 transitions. [2024-11-09 00:29:23,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 987 transitions. [2024-11-09 00:29:23,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:29:23,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:23,365 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:23,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:29:23,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:23,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:23,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1874104475, now seen corresponding path program 1 times [2024-11-09 00:29:23,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:23,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830321526] [2024-11-09 00:29:23,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:23,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:23,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:23,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830321526] [2024-11-09 00:29:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830321526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:23,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:29:23,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9920410] [2024-11-09 00:29:23,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:29:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:29:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:29:23,752 INFO L87 Difference]: Start difference. First operand 644 states and 987 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:24,269 INFO L93 Difference]: Finished difference Result 1629 states and 2482 transitions. [2024-11-09 00:29:24,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:29:24,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 163 [2024-11-09 00:29:24,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:24,275 INFO L225 Difference]: With dead ends: 1629 [2024-11-09 00:29:24,275 INFO L226 Difference]: Without dead ends: 1116 [2024-11-09 00:29:24,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:29:24,277 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 395 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:24,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 782 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:29:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-09 00:29:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 644. [2024-11-09 00:29:24,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 539 states have (on average 1.4656771799628943) internal successors, (790), 542 states have internal predecessors, (790), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 982 transitions. [2024-11-09 00:29:24,352 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 982 transitions. Word has length 163 [2024-11-09 00:29:24,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:24,353 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 982 transitions. [2024-11-09 00:29:24,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:29:24,354 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 982 transitions. [2024-11-09 00:29:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:29:24,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:24,355 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:29:24,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:24,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2014653085, now seen corresponding path program 1 times [2024-11-09 00:29:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:24,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029137867] [2024-11-09 00:29:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:24,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:24,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:24,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:29:24,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:24,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029137867] [2024-11-09 00:29:24,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029137867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:29:24,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:29:24,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:29:24,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900488293] [2024-11-09 00:29:24,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:29:24,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:29:24,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:24,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:29:24,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:29:24,803 INFO L87 Difference]: Start difference. First operand 644 states and 982 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:25,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:25,474 INFO L93 Difference]: Finished difference Result 1512 states and 2313 transitions. [2024-11-09 00:29:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:29:25,475 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 163 [2024-11-09 00:29:25,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:25,483 INFO L225 Difference]: With dead ends: 1512 [2024-11-09 00:29:25,483 INFO L226 Difference]: Without dead ends: 1069 [2024-11-09 00:29:25,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:29:25,486 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 605 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:25,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 802 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:29:25,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2024-11-09 00:29:25,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 692. [2024-11-09 00:29:25,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 587 states have (on average 1.4804088586030664) internal successors, (869), 590 states have internal predecessors, (869), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:25,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1061 transitions. [2024-11-09 00:29:25,608 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1061 transitions. Word has length 163 [2024-11-09 00:29:25,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:25,609 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1061 transitions. [2024-11-09 00:29:25,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:29:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1061 transitions. [2024-11-09 00:29:25,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:29:25,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:25,614 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:25,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:29:25,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:25,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:25,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2083825611, now seen corresponding path program 1 times [2024-11-09 00:29:25,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:25,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027294260] [2024-11-09 00:29:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:25,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:25,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:29:25,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027294260] [2024-11-09 00:29:25,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027294260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:29:25,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780316835] [2024-11-09 00:29:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:25,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:25,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:25,935 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:29:25,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:29:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:26,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:29:26,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:29:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-09 00:29:26,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:29:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:29:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780316835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:29:26,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:29:26,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:29:26,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888302746] [2024-11-09 00:29:26,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:29:26,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:29:26,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:26,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:29:26,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:29:26,565 INFO L87 Difference]: Start difference. First operand 692 states and 1061 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-09 00:29:26,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:26,795 INFO L93 Difference]: Finished difference Result 1349 states and 2053 transitions. [2024-11-09 00:29:26,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:29:26,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 163 [2024-11-09 00:29:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:26,799 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 00:29:26,799 INFO L226 Difference]: Without dead ends: 711 [2024-11-09 00:29:26,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:29:26,804 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 151 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:26,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 328 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:29:26,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-09 00:29:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 703. [2024-11-09 00:29:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 594 states have (on average 1.4343434343434343) internal successors, (852), 597 states have internal predecessors, (852), 96 states have call successors, (96), 12 states have call predecessors, (96), 12 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-09 00:29:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1044 transitions. [2024-11-09 00:29:26,880 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1044 transitions. Word has length 163 [2024-11-09 00:29:26,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:26,881 INFO L471 AbstractCegarLoop]: Abstraction has 703 states and 1044 transitions. [2024-11-09 00:29:26,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (41), 2 states have call predecessors, (41), 4 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2024-11-09 00:29:26,881 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1044 transitions. [2024-11-09 00:29:26,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-09 00:29:26,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:26,884 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:26,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 00:29:27,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:27,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:27,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1138529011, now seen corresponding path program 1 times [2024-11-09 00:29:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:27,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084030235] [2024-11-09 00:29:27,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:27,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:29:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084030235] [2024-11-09 00:29:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084030235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:29:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930551703] [2024-11-09 00:29:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:27,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:27,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:27,309 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:29:27,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 00:29:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:27,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:29:27,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:29:27,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 186 proven. 60 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-09 00:29:27,620 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:29:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:29:27,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930551703] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:29:27,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:29:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:29:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2936590] [2024-11-09 00:29:27,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:29:27,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:29:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:29:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:29:27,801 INFO L87 Difference]: Start difference. First operand 703 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-09 00:29:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:27,976 INFO L93 Difference]: Finished difference Result 1183 states and 1730 transitions. [2024-11-09 00:29:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:29:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 163 [2024-11-09 00:29:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:27,979 INFO L225 Difference]: With dead ends: 1183 [2024-11-09 00:29:27,979 INFO L226 Difference]: Without dead ends: 537 [2024-11-09 00:29:27,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:29:27,981 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 161 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:27,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 289 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:29:27,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-09 00:29:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 412. [2024-11-09 00:29:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 330 states have (on average 1.3575757575757577) internal successors, (448), 330 states have internal predecessors, (448), 69 states have call successors, (69), 12 states have call predecessors, (69), 12 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-09 00:29:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 586 transitions. [2024-11-09 00:29:28,028 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 586 transitions. Word has length 163 [2024-11-09 00:29:28,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:28,028 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 586 transitions. [2024-11-09 00:29:28,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-09 00:29:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 586 transitions. [2024-11-09 00:29:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:29:28,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:28,030 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:28,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:29:28,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 00:29:28,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:28,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1630805149, now seen corresponding path program 1 times [2024-11-09 00:29:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610732002] [2024-11-09 00:29:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:28,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:29:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:29:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 00:29:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:29:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 00:29:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:29:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 00:29:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-09 00:29:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-09 00:29:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 00:29:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 00:29:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 00:29:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 00:29:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 00:29:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 00:29:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:29:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 00:29:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:29:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 00:29:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:29:28,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:29:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:29:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:29:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 12 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-09 00:29:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:29:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610732002] [2024-11-09 00:29:28,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610732002] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:29:28,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81263618] [2024-11-09 00:29:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:28,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:28,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:28,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:29:28,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 00:29:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:29:28,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 00:29:28,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:29:28,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 411 proven. 12 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-09 00:29:28,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:29:29,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 114 proven. 15 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-09 00:29:29,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81263618] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:29:29,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:29:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-09 00:29:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224551644] [2024-11-09 00:29:29,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:29:29,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:29:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:29:29,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:29:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:29:29,285 INFO L87 Difference]: Start difference. First operand 412 states and 586 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:29:29,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:29:29,999 INFO L93 Difference]: Finished difference Result 1054 states and 1462 transitions. [2024-11-09 00:29:30,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 00:29:30,000 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) Word has length 165 [2024-11-09 00:29:30,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:29:30,004 INFO L225 Difference]: With dead ends: 1054 [2024-11-09 00:29:30,004 INFO L226 Difference]: Without dead ends: 768 [2024-11-09 00:29:30,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 369 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=762, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 00:29:30,006 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 578 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 00:29:30,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 764 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 00:29:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-09 00:29:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 464. [2024-11-09 00:29:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 376 states have (on average 1.3457446808510638) internal successors, (506), 376 states have internal predecessors, (506), 69 states have call successors, (69), 18 states have call predecessors, (69), 18 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-09 00:29:30,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 644 transitions. [2024-11-09 00:29:30,056 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 644 transitions. Word has length 165 [2024-11-09 00:29:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:29:30,056 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 644 transitions. [2024-11-09 00:29:30,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (30), 3 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-09 00:29:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 644 transitions. [2024-11-09 00:29:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-09 00:29:30,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:29:30,058 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:29:30,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 00:29:30,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:30,259 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:29:30,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:29:30,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1963097569, now seen corresponding path program 1 times [2024-11-09 00:29:30,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:29:30,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274744457] [2024-11-09 00:29:30,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:30,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:29:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:29:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307296968] [2024-11-09 00:29:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:29:30,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:30,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:30,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:29:30,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:29:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:29:30,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:29:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:29:30,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:29:30,553 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:29:30,553 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:29:30,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 00:29:30,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:29:30,762 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:29:30,836 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:29:30,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:29:30 BoogieIcfgContainer [2024-11-09 00:29:30,838 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:29:30,839 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:29:30,839 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:29:30,839 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:29:30,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:29:16" (3/4) ... [2024-11-09 00:29:30,842 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:29:30,842 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:29:30,843 INFO L158 Benchmark]: Toolchain (without parser) took 14978.03ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 116.1MB in the beginning and 330.1MB in the end (delta: -214.0MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,843 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:29:30,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.78ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 98.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,844 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.85ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 93.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,844 INFO L158 Benchmark]: Boogie Preprocessor took 57.57ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 87.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,844 INFO L158 Benchmark]: RCFGBuilder took 641.79ms. Allocated memory is still 184.5MB. Free memory was 87.8MB in the beginning and 128.4MB in the end (delta: -40.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,844 INFO L158 Benchmark]: TraceAbstraction took 13908.34ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 128.4MB in the beginning and 330.1MB in the end (delta: -201.7MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. [2024-11-09 00:29:30,844 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 486.5MB. Free memory is still 330.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:29:30,845 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.17ms. Allocated memory is still 184.5MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.78ms. Allocated memory is still 184.5MB. Free memory was 115.9MB in the beginning and 98.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.85ms. Allocated memory is still 184.5MB. Free memory was 98.2MB in the beginning and 93.9MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.57ms. Allocated memory is still 184.5MB. Free memory was 93.9MB in the beginning and 87.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 641.79ms. Allocated memory is still 184.5MB. Free memory was 87.8MB in the beginning and 128.4MB in the end (delta: -40.6MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13908.34ms. Allocated memory was 184.5MB in the beginning and 486.5MB in the end (delta: 302.0MB). Free memory was 128.4MB in the beginning and 330.1MB in the end (delta: -201.7MB). Peak memory consumption was 102.3MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 486.5MB. Free memory is still 330.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticDOUBLEoperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.8; [L23] float var_1_6 = 16.375; [L24] float var_1_7 = 0.25; [L25] unsigned char var_1_8 = 1; [L26] unsigned char var_1_9 = 1; [L27] unsigned char var_1_10 = 0; [L28] unsigned long int var_1_11 = 128; [L29] double var_1_13 = 255.5; [L30] double var_1_14 = 0.0; [L31] double var_1_15 = 0.0; [L32] double var_1_16 = 100.3; [L33] unsigned long int var_1_17 = 32; [L34] unsigned short int var_1_19 = 100; [L35] double var_1_21 = 10000000000.5; [L36] double var_1_22 = 32.2; [L37] signed short int var_1_23 = -2; [L38] signed char var_1_24 = 32; [L39] signed char var_1_25 = 10; [L40] signed char var_1_26 = -128; [L41] double var_1_27 = 5.8; [L42] unsigned short int var_1_28 = 16; [L43] unsigned char var_1_30 = 1; [L44] unsigned char var_1_31 = 0; [L45] unsigned char var_1_32 = 0; [L46] unsigned long int var_1_33 = 256; [L47] unsigned char var_1_34 = 0; [L48] float var_1_35 = 3.625; [L49] float var_1_36 = 9.8; [L50] unsigned char var_1_37 = 4; [L51] unsigned long int last_1_var_1_17 = 32; [L52] double last_1_var_1_22 = 32.2; [L53] double last_1_var_1_27 = 5.8; [L54] unsigned char last_1_var_1_37 = 4; VAL [isInitial=0, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L182] last_1_var_1_17 = var_1_17 [L183] last_1_var_1_22 = var_1_22 [L184] last_1_var_1_27 = var_1_27 [L185] last_1_var_1_37 = var_1_37 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_6=131/8, var_1_7=1/4, var_1_8=1, var_1_9=1] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_7=1/4, var_1_8=1, var_1_9=1] [L146] var_1_7 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L147] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=0, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_14=0, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L154] var_1_14 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_14 >= 4611686.018427382800e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_15=0, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L156] var_1_15 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_16=1003/10, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L158] var_1_16 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=32, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L160] var_1_24 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L161] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=10, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L163] var_1_25 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L164] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=-128, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L166] var_1_26 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_26 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L167] RET assume_abort_if_not(var_1_26 >= -128) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L168] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_26 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L169] RET assume_abort_if_not(var_1_26 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L170] var_1_31 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L171] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L172] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=256, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L173] var_1_33 = __VERIFIER_nondet_ulong() [L174] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L174] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] CALL assume_abort_if_not(var_1_33 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L175] RET assume_abort_if_not(var_1_33 <= 4294967295) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] CALL assume_abort_if_not(var_1_33 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L176] RET assume_abort_if_not(var_1_33 != 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L177] var_1_34 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L178] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] CALL assume_abort_if_not(var_1_34 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L179] RET assume_abort_if_not(var_1_34 <= 0) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=20000000001/2, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L196] RET updateVariables() [L197] CALL step() [L58] COND TRUE (- last_1_var_1_27) < var_1_7 [L59] var_1_21 = 0.19999999999999996 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L63] COND TRUE ((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16) [L64] var_1_28 = ((var_1_25 + (100 + 64)) + last_1_var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=128, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L68] COND TRUE \read(var_1_9) [L69] var_1_11 = 0u VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L79] COND TRUE \read(var_1_9) [L80] var_1_30 = (! var_1_31) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=29/8, var_1_36=49/5, var_1_37=4, var_1_8=1, var_1_9=1] [L82] var_1_35 = var_1_16 [L83] var_1_36 = var_1_14 [L84] var_1_37 = var_1_25 [L85] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_3=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=100, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L86] COND FALSE !(var_1_28 <= stepLocal_3) [L89] var_1_19 = ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L91] unsigned long int stepLocal_0 = 1u; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L92] COND FALSE !(((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L97] signed long int stepLocal_4 = (var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4))); VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_4=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L98] COND FALSE !(stepLocal_4 > var_1_37) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L101] signed long int stepLocal_2 = var_1_19 - var_1_19; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L102] COND TRUE \read(var_1_9) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L103] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] EXPR (last_1_var_1_17 / -64) << var_1_11 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_2=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=32, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L104] COND TRUE ((last_1_var_1_17 / -64) << var_1_11) >= stepLocal_2 [L105] var_1_17 = var_1_19 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] EXPR var_1_37 ^ (4u / var_1_33) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L113] COND FALSE !((var_1_37 ^ (4u / var_1_33)) != var_1_17) [L116] var_1_32 = (var_1_31 || var_1_34) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L118] COND FALSE !(((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L121] signed long int stepLocal_5 = var_1_19 + var_1_37; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L122] COND TRUE var_1_28 != stepLocal_5 VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L123] COND FALSE !(var_1_1 < var_1_21) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_8=1, var_1_9=1] [L127] COND FALSE !(((var_1_16 * var_1_6) > var_1_15) && var_1_32) [L130] var_1_22 = ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L132] unsigned short int stepLocal_1 = var_1_28; VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_13=511/2, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L133] COND TRUE var_1_7 != (var_1_27 * var_1_6) [L134] var_1_13 = ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, stepLocal_0=1, stepLocal_1=168, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR (((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188] EXPR (((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34)))) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L188-L189] return ((((((((((((((((((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23) ? (var_1_1 == ((float) (var_1_6 - var_1_7))) : 1) && ((((((var_1_7) < (var_1_35)) ? (var_1_7) : (var_1_35))) <= var_1_6) ? ((1u < var_1_37) ? (var_1_8 == ((unsigned char) (var_1_9 && var_1_10))) : 1) : 1)) && (var_1_9 ? (var_1_11 == ((unsigned long int) 0u)) : (var_1_10 ? (var_1_11 == ((unsigned long int) ((((8u + var_1_28) < 0 ) ? -(8u + var_1_28) : (8u + var_1_28))))) : ((var_1_6 < 127.5f) ? (var_1_11 == ((unsigned long int) var_1_28)) : 1)))) && ((var_1_7 != (var_1_27 * var_1_6)) ? (var_1_13 == ((double) ((((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) - var_1_16) - var_1_7))) : ((var_1_28 > var_1_28) ? (var_1_13 == ((double) 10.6)) : (var_1_13 == ((double) var_1_15))))) && (var_1_9 ? (var_1_10 ? ((((last_1_var_1_17 / -64) << var_1_11) >= (var_1_19 - var_1_19)) ? (var_1_17 == ((unsigned long int) var_1_19)) : 1) : (var_1_17 == ((unsigned long int) var_1_19))) : (var_1_17 == ((unsigned long int) 2u)))) && ((var_1_28 <= var_1_37) ? (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))) : (var_1_19 == ((unsigned short int) ((((var_1_37) < 0 ) ? -(var_1_37) : (var_1_37))))))) && (((- last_1_var_1_27) < var_1_7) ? (var_1_21 == ((double) 0.19999999999999996)) : (var_1_21 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))))) && ((((var_1_16 * var_1_6) > var_1_15) && var_1_32) ? (var_1_22 == ((double) var_1_6)) : (var_1_22 == ((double) ((((var_1_15) < (var_1_7)) ? (var_1_15) : (var_1_7))))))) && ((((var_1_24 - var_1_25) / ((((var_1_26) < (4)) ? (var_1_26) : (4)))) > var_1_37) ? (var_1_23 == ((signed short int) var_1_24)) : 1)) && ((var_1_28 != (var_1_19 + var_1_37)) ? ((var_1_1 < var_1_21) ? (var_1_27 == ((double) (var_1_15 - var_1_16))) : 1) : 1)) && ((((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) ? (var_1_28 == ((unsigned short int) ((var_1_25 + (100 + 64)) + last_1_var_1_37))) : (var_1_28 == ((unsigned short int) last_1_var_1_37)))) && (var_1_9 ? (var_1_30 == ((unsigned char) (! var_1_31))) : 1)) && (((var_1_37 ^ (4u / var_1_33)) != var_1_17) ? (var_1_32 == ((unsigned char) ((99.6f != var_1_7) || var_1_10))) : (var_1_32 == ((unsigned char) (var_1_31 || var_1_34))))) && (var_1_35 == ((float) var_1_16))) && (var_1_36 == ((float) var_1_14))) && (var_1_37 == ((unsigned char) var_1_25)) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=32, last_1_var_1_22=161/5, last_1_var_1_27=29/5, last_1_var_1_37=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=0, var_1_19=0, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=-2, var_1_24=2, var_1_25=0, var_1_26=3, var_1_27=29/5, var_1_28=168, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=6, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=0, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 12, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3868 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3844 mSDsluCounter, 6862 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4986 mSDsCounter, 959 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3306 IncrementalHoareTripleChecker+Invalid, 4265 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 959 mSolverCounterUnsat, 1876 mSDtfsCounter, 3306 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1639 GetRequests, 1524 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=703occurred in iteration=9, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 3101 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2608 NumberOfCodeBlocks, 2608 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2752 ConstructedInterpolants, 0 QuantifiedInterpolants, 9933 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1194 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 16823/17204 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-11-09 00:29:30,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:29:32,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:29:32,981 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:29:32,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:29:32,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:29:33,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:29:33,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:29:33,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:29:33,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:29:33,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:29:33,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:29:33,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:29:33,009 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:29:33,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:29:33,010 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:29:33,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:29:33,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:29:33,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:29:33,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:29:33,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:29:33,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:29:33,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:29:33,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:29:33,016 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:29:33,018 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:29:33,019 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:29:33,019 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:29:33,019 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:29:33,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:29:33,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:29:33,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:29:33,020 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:29:33,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:29:33,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:29:33,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:33,020 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:29:33,021 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:29:33,021 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:29:33,021 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:29:33,021 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:29:33,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:29:33,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:29:33,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:29:33,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:29:33,022 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 56064daaba05050964f220dcd42c097e23ee92990bd0e372b460532857ef7215 [2024-11-09 00:29:33,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:29:33,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:29:33,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:29:33,308 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:29:33,309 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:29:33,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-09 00:29:34,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:29:34,954 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:29:34,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-09 00:29:34,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7889e457/9fb5abf881034a1db9432d3579ba2892/FLAG4ac055b95 [2024-11-09 00:29:34,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7889e457/9fb5abf881034a1db9432d3579ba2892 [2024-11-09 00:29:34,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:29:34,981 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:29:34,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:34,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:29:34,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:29:34,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:34" (1/1) ... [2024-11-09 00:29:34,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63b47486 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:34, skipping insertion in model container [2024-11-09 00:29:34,991 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:29:34" (1/1) ... [2024-11-09 00:29:35,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:29:35,178 WARN L250 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_operatoramount_amount100_file-80.i[916,929] [2024-11-09 00:29:35,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:35,277 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:29:35,288 WARN L250 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_operatoramount_amount100_file-80.i[916,929] [2024-11-09 00:29:35,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:29:35,374 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:29:35,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35 WrapperNode [2024-11-09 00:29:35,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:29:35,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:35,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:29:35,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:29:35,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,448 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-09 00:29:35,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:29:35,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:29:35,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:29:35,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:29:35,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,495 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-11-09 00:29:35,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,534 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:29:35,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:29:35,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:29:35,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:29:35,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (1/1) ... [2024-11-09 00:29:35,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:29:35,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:29:35,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:29:35,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:29:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:29:35,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:29:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:29:35,640 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:29:35,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:29:35,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:29:35,732 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:29:35,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:30:01,198 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-09 00:30:01,199 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:30:01,215 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:30:01,215 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:30:01,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:01 BoogieIcfgContainer [2024-11-09 00:30:01,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:30:01,219 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:30:01,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:30:01,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:30:01,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:29:34" (1/3) ... [2024-11-09 00:30:01,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355480d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:01, skipping insertion in model container [2024-11-09 00:30:01,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:29:35" (2/3) ... [2024-11-09 00:30:01,224 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@355480d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:30:01, skipping insertion in model container [2024-11-09 00:30:01,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:30:01" (3/3) ... [2024-11-09 00:30:01,226 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-09 00:30:01,241 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:30:01,241 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:30:01,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:30:01,307 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;@52e5d71c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:30:01,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:30:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:30:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 00:30:01,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:01,326 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:30:01,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:01,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:01,331 INFO L85 PathProgramCache]: Analyzing trace with hash 120401077, now seen corresponding path program 1 times [2024-11-09 00:30:01,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:30:01,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977226627] [2024-11-09 00:30:01,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:01,345 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-11-09 00:30:01,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:30:01,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:30:01,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:30:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:02,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:30:02,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:02,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-09 00:30:02,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:30:02,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:30:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977226627] [2024-11-09 00:30:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977226627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:30:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:30:02,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:30:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310691182] [2024-11-09 00:30:02,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:30:02,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:30:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:30:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:30:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:30:02,403 INFO L87 Difference]: Start difference. First operand has 81 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:30:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:30:02,448 INFO L93 Difference]: Finished difference Result 155 states and 269 transitions. [2024-11-09 00:30:02,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:30:02,453 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-11-09 00:30:02,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:30:02,468 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:30:02,469 INFO L226 Difference]: Without dead ends: 77 [2024-11-09 00:30:02,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-11-09 00:30:02,477 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:30:02,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:30:02,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-09 00:30:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-09 00:30:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:30:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 119 transitions. [2024-11-09 00:30:02,538 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 119 transitions. Word has length 156 [2024-11-09 00:30:02,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:30:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 119 transitions. [2024-11-09 00:30:02,543 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, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:30:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 119 transitions. [2024-11-09 00:30:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 00:30:02,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:30:02,548 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 00:30:02,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:30:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:30:02,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:30:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:30:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash 71316607, now seen corresponding path program 1 times [2024-11-09 00:30:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:30:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [890988535] [2024-11-09 00:30:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:30:02,751 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-11-09 00:30:02,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:30:02,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:30:02,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:30:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:30:03,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 00:30:03,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:30:12,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-11-09 00:30:12,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:30:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:30:16,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:30:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [890988535] [2024-11-09 00:30:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [890988535] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:30:16,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:30:16,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-09 00:30:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606891139] [2024-11-09 00:30:16,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:30:16,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:30:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:30:16,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:30:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:30:16,303 INFO L87 Difference]: Start difference. First operand 77 states and 119 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2024-11-09 00:30:26,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:31,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:33,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:39,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:43,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:30:47,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []