./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:13:08,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:13:08,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:13:08,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:13:08,693 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:13:08,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:13:08,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:13:08,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:13:08,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:13:08,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:13:08,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:13:08,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:13:08,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:13:08,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:13:08,732 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:13:08,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:13:08,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:13:08,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:13:08,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:13:08,735 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:13:08,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:13:08,736 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:13:08,736 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:13:08,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:13:08,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:13:08,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:13:08,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:13:08,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:13:08,738 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:13:08,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:13:08,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:13:08,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:13:08,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:13:08,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:13:08,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:13:08,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:13:08,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:13:08,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:13:08,741 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:13:08,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:13:08,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:13:08,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:13:08,743 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-10 08:13:09,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:13:09,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:13:09,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:13:09,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:13:09,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:13:09,087 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-10 08:13:10,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:13:10,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:13:10,886 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-10 08:13:10,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586b74564/5e81bf98c265415791aac4008949e44e/FLAG0b2adac43 [2024-11-10 08:13:11,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/586b74564/5e81bf98c265415791aac4008949e44e [2024-11-10 08:13:11,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:13:11,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:13:11,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:13:11,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:13:11,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:13:11,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47240516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11, skipping insertion in model container [2024-11-10 08:13:11,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:13:11,506 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-10 08:13:11,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:13:11,615 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:13:11,628 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-10 08:13:11,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:13:11,759 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:13:11,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11 WrapperNode [2024-11-10 08:13:11,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:13:11,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:13:11,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:13:11,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:13:11,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,826 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 244 [2024-11-10 08:13:11,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:13:11,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:13:11,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:13:11,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:13:11,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,872 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-10 08:13:11,872 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,912 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:13:11,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:13:11,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:13:11,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:13:11,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (1/1) ... [2024-11-10 08:13:11,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:13:11,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:11,959 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-10 08:13:11,961 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-10 08:13:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:13:12,004 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:13:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:13:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:13:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:13:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:13:12,106 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:13:12,108 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:13:12,590 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L188: havoc property_#t~ite21#1;havoc property_#t~ite20#1;havoc property_#t~bitwise19#1;havoc property_#t~short22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-10 08:13:12,646 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-10 08:13:12,646 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:13:12,677 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:13:12,678 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 08:13:12,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:13:12 BoogieIcfgContainer [2024-11-10 08:13:12,679 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:13:12,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:13:12,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:13:12,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:13:12,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:13:11" (1/3) ... [2024-11-10 08:13:12,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd83b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:13:12, skipping insertion in model container [2024-11-10 08:13:12,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:11" (2/3) ... [2024-11-10 08:13:12,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd83b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:13:12, skipping insertion in model container [2024-11-10 08:13:12,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:13:12" (3/3) ... [2024-11-10 08:13:12,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-10 08:13:12,709 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:13:12,709 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:13:12,778 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:13:12,788 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;@18c48a84, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:13:12,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:13:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 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-10 08:13:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 08:13:12,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:12,808 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-10 08:13:12,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1234599714, now seen corresponding path program 1 times [2024-11-10 08:13:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212908438] [2024-11-10 08:13:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:12,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:13,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:13,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,322 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-10 08:13:13,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212908438] [2024-11-10 08:13:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212908438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:13:13,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201879161] [2024-11-10 08:13:13,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:13,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:13:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:13,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:13:13,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:13:13,373 INFO L87 Difference]: Start difference. First operand has 106 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-10 08:13:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:13,414 INFO L93 Difference]: Finished difference Result 204 states and 342 transitions. [2024-11-10 08:13:13,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:13:13,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (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 163 [2024-11-10 08:13:13,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:13,425 INFO L225 Difference]: With dead ends: 204 [2024-11-10 08:13:13,426 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 08:13:13,429 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-10 08:13:13,433 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:13,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:13:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 08:13:13,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-10 08:13:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 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-10 08:13:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-11-10 08:13:13,490 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 163 [2024-11-10 08:13:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:13,490 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-11-10 08:13:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (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-10 08:13:13,491 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-11-10 08:13:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 08:13:13,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:13,497 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-10 08:13:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:13:13,498 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:13,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1938307837, now seen corresponding path program 1 times [2024-11-10 08:13:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273391645] [2024-11-10 08:13:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:13,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:13,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:13,875 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-10 08:13:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273391645] [2024-11-10 08:13:13,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273391645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:13,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:13,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:13:13,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509431776] [2024-11-10 08:13:13,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:13,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:13:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:13,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:13:13,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:13:13,882 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (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-10 08:13:13,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:13,976 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2024-11-10 08:13:13,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:13:13,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (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-10 08:13:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:13,984 INFO L225 Difference]: With dead ends: 251 [2024-11-10 08:13:13,987 INFO L226 Difference]: Without dead ends: 153 [2024-11-10 08:13:13,988 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-10 08:13:13,992 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 79 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:13,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 268 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:13:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-10 08:13:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2024-11-10 08:13:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 121 states have (on average 1.43801652892562) internal successors, (174), 122 states have internal predecessors, (174), 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-10 08:13:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2024-11-10 08:13:14,024 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 163 [2024-11-10 08:13:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:14,025 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2024-11-10 08:13:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (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-10 08:13:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2024-11-10 08:13:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 08:13:14,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:14,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] [2024-11-10 08:13:14,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:13:14,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:14,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1258142729, now seen corresponding path program 1 times [2024-11-10 08:13:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777503683] [2024-11-10 08:13:14,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:14,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:14,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:14,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:15,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:15,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:15,126 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-10 08:13:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:15,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777503683] [2024-11-10 08:13:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777503683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:15,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:15,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:13:15,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050417341] [2024-11-10 08:13:15,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:15,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:13:15,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:15,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:13:15,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:13:15,130 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 08:13:15,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:15,664 INFO L93 Difference]: Finished difference Result 620 states and 937 transitions. [2024-11-10 08:13:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:13:15,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 164 [2024-11-10 08:13:15,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:15,670 INFO L225 Difference]: With dead ends: 620 [2024-11-10 08:13:15,670 INFO L226 Difference]: Without dead ends: 474 [2024-11-10 08:13:15,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:13:15,672 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 460 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:15,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 799 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:13:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-11-10 08:13:15,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 270. [2024-11-10 08:13:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 217 states have (on average 1.4423963133640554) internal successors, (313), 218 states have internal predecessors, (313), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 08:13:15,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 409 transitions. [2024-11-10 08:13:15,718 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 409 transitions. Word has length 164 [2024-11-10 08:13:15,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:15,720 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 409 transitions. [2024-11-10 08:13:15,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 08:13:15,720 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 409 transitions. [2024-11-10 08:13:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 08:13:15,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:15,726 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] [2024-11-10 08:13:15,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:13:15,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:15,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:15,727 INFO L85 PathProgramCache]: Analyzing trace with hash -819066614, now seen corresponding path program 1 times [2024-11-10 08:13:15,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:15,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446516333] [2024-11-10 08:13:15,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:15,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:16,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:16,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:16,328 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-10 08:13:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446516333] [2024-11-10 08:13:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446516333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:13:16,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822589359] [2024-11-10 08:13:16,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:16,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:13:16,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:16,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:13:16,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:13:16,333 INFO L87 Difference]: Start difference. First operand 270 states and 409 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-10 08:13:17,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:17,105 INFO L93 Difference]: Finished difference Result 657 states and 993 transitions. [2024-11-10 08:13:17,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:13:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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 164 [2024-11-10 08:13:17,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:17,111 INFO L225 Difference]: With dead ends: 657 [2024-11-10 08:13:17,111 INFO L226 Difference]: Without dead ends: 511 [2024-11-10 08:13:17,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:13:17,116 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 373 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:17,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 859 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:13:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-10 08:13:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 298. [2024-11-10 08:13:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 245 states have (on average 1.457142857142857) internal successors, (357), 246 states have internal predecessors, (357), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 08:13:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 453 transitions. [2024-11-10 08:13:17,149 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 453 transitions. Word has length 164 [2024-11-10 08:13:17,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:17,150 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 453 transitions. [2024-11-10 08:13:17,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 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-10 08:13:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 453 transitions. [2024-11-10 08:13:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 08:13:17,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:17,153 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] [2024-11-10 08:13:17,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:13:17,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:17,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash 565041032, now seen corresponding path program 1 times [2024-11-10 08:13:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:17,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791229495] [2024-11-10 08:13:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:17,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:17,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:17,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:17,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:17,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:17,603 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-10 08:13:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:17,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791229495] [2024-11-10 08:13:17,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791229495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:17,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 08:13:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058257988] [2024-11-10 08:13:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:17,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:13:17,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:17,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:13:17,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:13:17,610 INFO L87 Difference]: Start difference. First operand 298 states and 453 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 08:13:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:18,450 INFO L93 Difference]: Finished difference Result 701 states and 1059 transitions. [2024-11-10 08:13:18,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:13:18,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 164 [2024-11-10 08:13:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:18,455 INFO L225 Difference]: With dead ends: 701 [2024-11-10 08:13:18,455 INFO L226 Difference]: Without dead ends: 555 [2024-11-10 08:13:18,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:13:18,457 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 401 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:18,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 868 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:13:18,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-10 08:13:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 307. [2024-11-10 08:13:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 254 states have (on average 1.4645669291338583) internal successors, (372), 255 states have internal predecessors, (372), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 08:13:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 468 transitions. [2024-11-10 08:13:18,509 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 468 transitions. Word has length 164 [2024-11-10 08:13:18,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:18,510 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 468 transitions. [2024-11-10 08:13:18,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-10 08:13:18,511 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 468 transitions. [2024-11-10 08:13:18,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 08:13:18,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:18,512 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-10 08:13:18,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:13:18,513 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:18,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:18,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2143751382, now seen corresponding path program 1 times [2024-11-10 08:13:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464109420] [2024-11-10 08:13:18,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:18,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:20,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:20,331 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-10 08:13:20,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464109420] [2024-11-10 08:13:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464109420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:20,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:13:20,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085728364] [2024-11-10 08:13:20,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:20,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:13:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:20,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:13:20,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:13:20,335 INFO L87 Difference]: Start difference. First operand 307 states and 468 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-10 08:13:21,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:21,230 INFO L93 Difference]: Finished difference Result 737 states and 1115 transitions. [2024-11-10 08:13:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:13:21,230 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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 165 [2024-11-10 08:13:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:21,235 INFO L225 Difference]: With dead ends: 737 [2024-11-10 08:13:21,235 INFO L226 Difference]: Without dead ends: 527 [2024-11-10 08:13:21,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:13:21,239 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 511 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:21,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 920 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:13:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-10 08:13:21,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 307. [2024-11-10 08:13:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 254 states have (on average 1.4566929133858268) internal successors, (370), 255 states have internal predecessors, (370), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 08:13:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 466 transitions. [2024-11-10 08:13:21,277 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 466 transitions. Word has length 165 [2024-11-10 08:13:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:21,277 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 466 transitions. [2024-11-10 08:13:21,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 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-10 08:13:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 466 transitions. [2024-11-10 08:13:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 08:13:21,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:21,279 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-10 08:13:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:13:21,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:21,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:21,280 INFO L85 PathProgramCache]: Analyzing trace with hash -2112731575, now seen corresponding path program 1 times [2024-11-10 08:13:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864203357] [2024-11-10 08:13:21,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:21,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:21,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:21,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:21,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:21,806 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-10 08:13:21,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864203357] [2024-11-10 08:13:21,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864203357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:21,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:21,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:13:21,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147904993] [2024-11-10 08:13:21,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:21,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:13:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:13:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:13:21,810 INFO L87 Difference]: Start difference. First operand 307 states and 466 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-10 08:13:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:22,297 INFO L93 Difference]: Finished difference Result 648 states and 982 transitions. [2024-11-10 08:13:22,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:13:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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 165 [2024-11-10 08:13:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:22,302 INFO L225 Difference]: With dead ends: 648 [2024-11-10 08:13:22,302 INFO L226 Difference]: Without dead ends: 445 [2024-11-10 08:13:22,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:13:22,303 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 309 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:22,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 575 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 08:13:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-10 08:13:22,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 418. [2024-11-10 08:13:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 340 states have (on average 1.438235294117647) internal successors, (489), 342 states have internal predecessors, (489), 71 states have call successors, (71), 6 states have call predecessors, (71), 6 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-10 08:13:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 631 transitions. [2024-11-10 08:13:22,362 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 631 transitions. Word has length 165 [2024-11-10 08:13:22,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:22,364 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 631 transitions. [2024-11-10 08:13:22,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (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-10 08:13:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 631 transitions. [2024-11-10 08:13:22,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 08:13:22,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:22,366 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-10 08:13:22,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:13:22,367 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:22,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:22,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1671701544, now seen corresponding path program 1 times [2024-11-10 08:13:22,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:22,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119934065] [2024-11-10 08:13:22,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:22,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:22,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,667 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-10 08:13:22,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119934065] [2024-11-10 08:13:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119934065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:13:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780302881] [2024-11-10 08:13:22,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:22,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:13:22,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:22,672 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-10 08:13:22,673 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-10 08:13:22,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:22,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:13:22,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:13:23,150 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-10 08:13:23,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:13:23,397 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-10 08:13:23,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780302881] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:13:23,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:13:23,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 08:13:23,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093800409] [2024-11-10 08:13:23,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:13:23,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:13:23,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:23,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:13:23,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:13:23,402 INFO L87 Difference]: Start difference. First operand 418 states and 631 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-10 08:13:23,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:23,644 INFO L93 Difference]: Finished difference Result 796 states and 1191 transitions. [2024-11-10 08:13:23,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:13:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 165 [2024-11-10 08:13:23,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:23,647 INFO L225 Difference]: With dead ends: 796 [2024-11-10 08:13:23,647 INFO L226 Difference]: Without dead ends: 433 [2024-11-10 08:13:23,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 372 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:13:23,652 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:23,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 321 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:13:23,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-10 08:13:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2024-11-10 08:13:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 346 states have (on average 1.393063583815029) internal successors, (482), 348 states have internal predecessors, (482), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-10 08:13:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 624 transitions. [2024-11-10 08:13:23,710 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 624 transitions. Word has length 165 [2024-11-10 08:13:23,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:23,711 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 624 transitions. [2024-11-10 08:13:23,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-10 08:13:23,712 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 624 transitions. [2024-11-10 08:13:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 08:13:23,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:23,714 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-10 08:13:23,733 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-10 08:13:23,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:13:23,915 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:23,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:23,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1632885265, now seen corresponding path program 1 times [2024-11-10 08:13:23,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:23,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611673415] [2024-11-10 08:13:23,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:23,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:25,375 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-10 08:13:25,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:25,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611673415] [2024-11-10 08:13:25,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611673415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:13:25,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:13:25,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:13:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114986022] [2024-11-10 08:13:25,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:13:25,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:13:25,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:25,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:13:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:13:25,377 INFO L87 Difference]: Start difference. First operand 427 states and 624 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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-10 08:13:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:26,616 INFO L93 Difference]: Finished difference Result 1081 states and 1578 transitions. [2024-11-10 08:13:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:13:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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 165 [2024-11-10 08:13:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:26,621 INFO L225 Difference]: With dead ends: 1081 [2024-11-10 08:13:26,622 INFO L226 Difference]: Without dead ends: 807 [2024-11-10 08:13:26,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-10 08:13:26,624 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 571 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:26,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 878 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 08:13:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-10 08:13:26,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 437. [2024-11-10 08:13:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 356 states have (on average 1.401685393258427) internal successors, (499), 358 states have internal predecessors, (499), 71 states have call successors, (71), 9 states have call predecessors, (71), 9 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-10 08:13:26,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 641 transitions. [2024-11-10 08:13:26,699 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 641 transitions. Word has length 165 [2024-11-10 08:13:26,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:26,700 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 641 transitions. [2024-11-10 08:13:26,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 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-10 08:13:26,700 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 641 transitions. [2024-11-10 08:13:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 08:13:26,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:26,704 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-10 08:13:26,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:13:26,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:26,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1122351088, now seen corresponding path program 1 times [2024-11-10 08:13:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:26,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491553797] [2024-11-10 08:13:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:26,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:26,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:26,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,032 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-10 08:13:27,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491553797] [2024-11-10 08:13:27,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491553797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:13:27,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414231811] [2024-11-10 08:13:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:27,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:13:27,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:27,035 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-10 08:13:27,036 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-10 08:13:27,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:27,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 08:13:27,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:13:27,413 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-10 08:13:27,413 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:13:27,608 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-10 08:13:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414231811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:13:27,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:13:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 08:13:27,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268083792] [2024-11-10 08:13:27,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:13:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 08:13:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:27,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 08:13:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:13:27,612 INFO L87 Difference]: Start difference. First operand 437 states and 641 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-10 08:13:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:27,825 INFO L93 Difference]: Finished difference Result 732 states and 1056 transitions. [2024-11-10 08:13:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:13:27,826 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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 165 [2024-11-10 08:13:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:27,829 INFO L225 Difference]: With dead ends: 732 [2024-11-10 08:13:27,829 INFO L226 Difference]: Without dead ends: 353 [2024-11-10 08:13:27,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 372 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-10 08:13:27,831 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 246 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:27,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 280 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:13:27,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-10 08:13:27,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 235. [2024-11-10 08:13:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 180 states have (on average 1.3166666666666667) internal successors, (237), 180 states have internal predecessors, (237), 46 states have call successors, (46), 8 states have call predecessors, (46), 8 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 08:13:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 329 transitions. [2024-11-10 08:13:27,868 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 329 transitions. Word has length 165 [2024-11-10 08:13:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:27,868 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 329 transitions. [2024-11-10 08:13:27,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-10 08:13:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 329 transitions. [2024-11-10 08:13:27,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 08:13:27,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:27,871 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, 1, 1] [2024-11-10 08:13:27,891 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-10 08:13:28,075 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-10 08:13:28,077 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:28,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:28,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1761734969, now seen corresponding path program 1 times [2024-11-10 08:13:28,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:28,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833077472] [2024-11-10 08:13:28,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:13:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:13:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 08:13:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:13:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 08:13:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:13:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 08:13:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 08:13:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-10 08:13:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-10 08:13:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 08:13:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 08:13:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-10 08:13:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 08:13:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-10 08:13:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 08:13:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-10 08:13:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 08:13:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 08:13:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 08:13:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 08:13:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 08:13:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 08:13:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,659 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-10 08:13:28,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:13:28,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833077472] [2024-11-10 08:13:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833077472] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:13:28,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680877852] [2024-11-10 08:13:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:28,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:13:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:28,662 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-10 08:13:28,670 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-10 08:13:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:13:28,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:13:28,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:13:29,053 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-10 08:13:29,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:13:29,421 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-10 08:13:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680877852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:13:29,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:13:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-11-10 08:13:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322757379] [2024-11-10 08:13:29,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:13:29,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 08:13:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:13:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 08:13:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:13:29,424 INFO L87 Difference]: Start difference. First operand 235 states and 329 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-10 08:13:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:13:30,030 INFO L93 Difference]: Finished difference Result 570 states and 781 transitions. [2024-11-10 08:13:30,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 08:13:30,031 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 167 [2024-11-10 08:13:30,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:13:30,033 INFO L225 Difference]: With dead ends: 570 [2024-11-10 08:13:30,035 INFO L226 Difference]: Without dead ends: 423 [2024-11-10 08:13:30,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 373 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-10 08:13:30,037 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 607 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:13:30,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 410 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:13:30,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-10 08:13:30,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 264. [2024-11-10 08:13:30,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 205 states have internal predecessors, (268), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 08:13:30,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 360 transitions. [2024-11-10 08:13:30,082 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 360 transitions. Word has length 167 [2024-11-10 08:13:30,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:13:30,083 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 360 transitions. [2024-11-10 08:13:30,083 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-10 08:13:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 360 transitions. [2024-11-10 08:13:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-10 08:13:30,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:30,085 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, 1, 1] [2024-11-10 08:13:30,104 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-10 08:13:30,285 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-10 08:13:30,286 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:30,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:30,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1632652250, now seen corresponding path program 1 times [2024-11-10 08:13:30,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:13:30,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124031839] [2024-11-10 08:13:30,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:30,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:13:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:13:30,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2133533762] [2024-11-10 08:13:30,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:30,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:13:30,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:30,402 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-10 08:13:30,404 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-10 08:13:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:13:30,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:13:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:13:30,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:13:30,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:13:30,795 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:13:30,816 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-10 08:13:30,997 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-10 08:13:31,000 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:13:31,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:13:31,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:13:31 BoogieIcfgContainer [2024-11-10 08:13:31,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:13:31,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:13:31,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:13:31,152 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:13:31,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:13:12" (3/4) ... [2024-11-10 08:13:31,155 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:13:31,156 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:13:31,156 INFO L158 Benchmark]: Toolchain (without parser) took 19918.22ms. Allocated memory was 148.9MB in the beginning and 388.0MB in the end (delta: 239.1MB). Free memory was 72.6MB in the beginning and 303.0MB in the end (delta: -230.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,157 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 148.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:13:31,157 INFO L158 Benchmark]: CACSL2BoogieTranslator took 518.45ms. Allocated memory is still 148.9MB. Free memory was 72.6MB in the beginning and 118.6MB in the end (delta: -46.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,157 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.90ms. Allocated memory is still 148.9MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,157 INFO L158 Benchmark]: Boogie Preprocessor took 95.90ms. Allocated memory is still 148.9MB. Free memory was 114.4MB in the beginning and 109.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,158 INFO L158 Benchmark]: IcfgBuilder took 754.79ms. Allocated memory is still 148.9MB. Free memory was 109.1MB in the beginning and 91.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,158 INFO L158 Benchmark]: TraceAbstraction took 18470.45ms. Allocated memory was 148.9MB in the beginning and 388.0MB in the end (delta: 239.1MB). Free memory was 91.1MB in the beginning and 303.0MB in the end (delta: -211.8MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2024-11-10 08:13:31,159 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 388.0MB. Free memory is still 303.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:13:31,160 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.35ms. Allocated memory is still 148.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 518.45ms. Allocated memory is still 148.9MB. Free memory was 72.6MB in the beginning and 118.6MB in the end (delta: -46.0MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.90ms. Allocated memory is still 148.9MB. Free memory was 118.6MB in the beginning and 114.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.90ms. Allocated memory is still 148.9MB. Free memory was 114.4MB in the beginning and 109.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 754.79ms. Allocated memory is still 148.9MB. Free memory was 109.1MB in the beginning and 91.4MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18470.45ms. Allocated memory was 148.9MB in the beginning and 388.0MB in the end (delta: 239.1MB). Free memory was 91.1MB in the beginning and 303.0MB in the end (delta: -211.8MB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 388.0MB. Free memory is still 303.0MB. 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 someBinaryArithmeticDOUBLEoperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryArithmeticFLOAToperation at line 119. 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, 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=127, var_1_25=2, 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=127, var_1_25=2, 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=127, var_1_25=2, 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=127, var_1_25=2, 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=127, var_1_25=2, 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=127, var_1_25=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=16, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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 FALSE !(((((8.25) < (last_1_var_1_22)) ? (8.25) : (last_1_var_1_22))) >= (var_1_15 * var_1_16)) [L66] var_1_28 = 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, 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=2, 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=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=62, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=-2, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, var_1_8=1, var_1_9=1] [L98] COND TRUE stepLocal_4 > var_1_37 [L99] var_1_23 = var_1_24 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_1=4/5, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, var_1_8=1, var_1_9=1] [L118] COND TRUE ((~ var_1_17) + (var_1_19 + var_1_37)) <= var_1_23 [L119] var_1_1 = (var_1_6 - 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_16=3, var_1_17=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, var_1_8=1, var_1_9=1] [L122] COND FALSE !(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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=161/5, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=4, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=4, var_1_10=1, var_1_11=0, var_1_14=2, var_1_15=4, var_1_16=3, var_1_17=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, 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=2, var_1_19=2, var_1_21=4999999999999999/25000000000000000, var_1_22=4, var_1_23=127, var_1_24=127, var_1_25=2, var_1_26=2, var_1_27=29/5, var_1_28=4, var_1_30=1, var_1_31=0, var_1_32=0, var_1_33=5, var_1_34=0, var_1_35=3, var_1_36=2, var_1_37=2, var_1_7=0, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 12, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3661 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3637 mSDsluCounter, 6329 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4518 mSDsCounter, 972 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3230 IncrementalHoareTripleChecker+Invalid, 4202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 972 mSolverCounterUnsat, 1811 mSDtfsCounter, 3230 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1655 GetRequests, 1535 SyntacticMatches, 5 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=437occurred in iteration=9, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 1569 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 2641 NumberOfCodeBlocks, 2641 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2787 ConstructedInterpolants, 0 QuantifiedInterpolants, 10510 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1209 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-10 08:13:31,215 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:13:33,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:13:33,550 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:13:33,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:13:33,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:13:33,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:13:33,586 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:13:33,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:13:33,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:13:33,589 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:13:33,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:13:33,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:13:33,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:13:33,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:13:33,592 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:13:33,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:13:33,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:13:33,593 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:13:33,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:13:33,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:13:33,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:13:33,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:13:33,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:13:33,598 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:13:33,599 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:13:33,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:13:33,599 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:13:33,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:13:33,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:13:33,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:13:33,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:13:33,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:13:33,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:13:33,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:13:33,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:13:33,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:13:33,603 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:13:33,603 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:13:33,603 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:13:33,603 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:13:33,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:13:33,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:13:33,604 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:13:33,604 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:13:33,605 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-10 08:13:33,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:13:33,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:13:33,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:13:33,964 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:13:33,965 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:13:33,966 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-10 08:13:35,579 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:13:35,806 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:13:35,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-80.i [2024-11-10 08:13:35,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe481ade7/140d4f96420c4fb2af8405ad727629a0/FLAGe9c5ba99f [2024-11-10 08:13:35,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe481ade7/140d4f96420c4fb2af8405ad727629a0 [2024-11-10 08:13:35,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:13:35,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:13:35,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:13:35,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:13:35,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:13:35,852 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:13:35" (1/1) ... [2024-11-10 08:13:35,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@531a4d0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:35, skipping insertion in model container [2024-11-10 08:13:35,853 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:13:35" (1/1) ... [2024-11-10 08:13:35,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:13:36,074 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-10 08:13:36,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:13:36,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:13:36,204 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-10 08:13:36,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:13:36,269 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:13:36,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36 WrapperNode [2024-11-10 08:13:36,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:13:36,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:13:36,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:13:36,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:13:36,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,330 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-10 08:13:36,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:13:36,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:13:36,337 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:13:36,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:13:36,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,355 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,374 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-10 08:13:36,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,390 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:13:36,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:13:36,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:13:36,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:13:36,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (1/1) ... [2024-11-10 08:13:36,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:13:36,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:13:36,431 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-10 08:13:36,433 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-10 08:13:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:13:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:13:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:13:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:13:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:13:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:13:36,550 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:13:36,552 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:13:59,164 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 08:13:59,165 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:13:59,181 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:13:59,181 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:13:59,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:13:59 BoogieIcfgContainer [2024-11-10 08:13:59,182 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:13:59,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:13:59,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:13:59,186 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:13:59,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:13:35" (1/3) ... [2024-11-10 08:13:59,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aef7e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:13:59, skipping insertion in model container [2024-11-10 08:13:59,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:13:36" (2/3) ... [2024-11-10 08:13:59,188 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aef7e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:13:59, skipping insertion in model container [2024-11-10 08:13:59,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:13:59" (3/3) ... [2024-11-10 08:13:59,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-80.i [2024-11-10 08:13:59,207 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:13:59,207 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:13:59,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:13:59,281 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;@2cd433d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:13:59,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:13:59,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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-10 08:13:59,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 08:13:59,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:13:59,301 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] [2024-11-10 08:13:59,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:13:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:13:59,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1790971122, now seen corresponding path program 1 times [2024-11-10 08:13:59,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:13:59,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244331194] [2024-11-10 08:13:59,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:13:59,320 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-10 08:13:59,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:13:59,322 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-10 08:13:59,338 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-10 08:14:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:00,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 08:14:00,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:14:00,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2024-11-10 08:14:00,454 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 08:14:00,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:14:00,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244331194] [2024-11-10 08:14:00,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244331194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:14:00,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:14:00,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:14:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728218689] [2024-11-10 08:14:00,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:14:00,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:14:00,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:14:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:14:00,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:14:00,500 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 59 states have internal predecessors, (83), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-10 08:14:00,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:14:00,530 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2024-11-10 08:14:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:14:00,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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 158 [2024-11-10 08:14:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:14:00,540 INFO L225 Difference]: With dead ends: 160 [2024-11-10 08:14:00,540 INFO L226 Difference]: Without dead ends: 79 [2024-11-10 08:14:00,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-10 08:14:00,547 INFO L432 NwaCegarLoop]: 121 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, 121 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-10 08:14:00,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:14:00,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-10 08:14:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-10 08:14:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 54 states have internal predecessors, (75), 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-10 08:14:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-10 08:14:00,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 158 [2024-11-10 08:14:00,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:14:00,598 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-10 08:14:00,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (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-10 08:14:00,598 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-10 08:14:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-10 08:14:00,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:14:00,602 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] [2024-11-10 08:14:00,641 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-10 08:14:00,803 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-10 08:14:00,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:14:00,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:14:00,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1117321811, now seen corresponding path program 1 times [2024-11-10 08:14:00,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:14:00,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967893836] [2024-11-10 08:14:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:14:00,806 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-10 08:14:00,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:14:00,808 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-10 08:14:00,809 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-10 08:14:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:14:01,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 08:14:01,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:14:09,747 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-10 08:14:09,747 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:14:13,659 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-10 08:14:13,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 08:14:13,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967893836] [2024-11-10 08:14:13,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967893836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:14:13,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 08:14:13,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2024-11-10 08:14:13,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062760493] [2024-11-10 08:14:13,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 08:14:13,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:14:13,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 08:14:13,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:14:13,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:14:13,665 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 14 states, 14 states have (on average 5.928571428571429) internal successors, (83), 14 states have internal predecessors, (83), 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-10 08:14:24,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 08:14:27,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []