./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-25_file-3.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 fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:18:38,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:18:38,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 13:18:38,700 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:18:38,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:18:38,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:18:38,756 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:18:38,756 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:18:38,757 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:18:38,757 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:18:38,757 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:18:38,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:18:38,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:18:38,758 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:18:38,758 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:18:38,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:18:38,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:18:38,759 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:18:38,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 13:18:38,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:18:38,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:18:38,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:18:38,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:18:38,762 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:18:38,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:18:38,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:18:38,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:18:38,763 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:18:38,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:18:38,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:18:38,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:18:38,764 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:18:38,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:18:38,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:18:38,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:18:38,765 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:18:38,765 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 13:18:38,765 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 13:18:38,765 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:18:38,765 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:18:38,766 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:18:38,766 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:18:38,767 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 -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2024-11-16 13:18:38,958 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:18:38,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:18:38,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:18:38,983 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:18:38,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:18:38,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:18:40,403 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:18:40,597 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:18:40,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:18:40,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f09d1b2/0ff0d522148746328fbfe84850b5bca9/FLAG5251be21f [2024-11-16 13:18:40,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f09d1b2/0ff0d522148746328fbfe84850b5bca9 [2024-11-16 13:18:40,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:18:40,621 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:18:40,622 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:18:40,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:18:40,627 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:18:40,628 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:18:40" (1/1) ... [2024-11-16 13:18:40,629 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391d711f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:40, skipping insertion in model container [2024-11-16 13:18:40,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:18:40" (1/1) ... [2024-11-16 13:18:40,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:18:40,854 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_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-11-16 13:18:40,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:18:40,958 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:18:40,967 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_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-11-16 13:18:40,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:18:41,007 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:18:41,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41 WrapperNode [2024-11-16 13:18:41,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:18:41,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:18:41,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:18:41,008 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:18:41,014 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,079 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 234 [2024-11-16 13:18:41,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:18:41,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:18:41,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:18:41,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:18:41,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,124 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-16 13:18:41,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,125 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,139 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,144 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:18:41,160 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:18:41,160 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:18:41,160 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:18:41,162 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (1/1) ... [2024-11-16 13:18:41,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:18:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:18:41,197 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-16 13:18:41,203 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-16 13:18:41,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:18:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:18:41,245 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:18:41,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 13:18:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:18:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:18:41,329 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:18:41,331 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:18:41,653 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L168: havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-16 13:18:41,699 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 13:18:41,700 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:18:41,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:18:41,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:18:41,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:18:41 BoogieIcfgContainer [2024-11-16 13:18:41,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:18:41,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:18:41,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:18:41,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:18:41,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:18:40" (1/3) ... [2024-11-16 13:18:41,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1966cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:18:41, skipping insertion in model container [2024-11-16 13:18:41,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:18:41" (2/3) ... [2024-11-16 13:18:41,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1966cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:18:41, skipping insertion in model container [2024-11-16 13:18:41,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:18:41" (3/3) ... [2024-11-16 13:18:41,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:18:41,743 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:18:41,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:18:41,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:18:41,804 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;@4971cab2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:18:41,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:18:41,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:18:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:18:41,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:41,822 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:41,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:41,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1150234878, now seen corresponding path program 1 times [2024-11-16 13:18:41,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:41,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805663068] [2024-11-16 13:18:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:41,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:42,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:42,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:42,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:42,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805663068] [2024-11-16 13:18:42,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805663068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:42,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:42,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:18:42,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408227122] [2024-11-16 13:18:42,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:42,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:18:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:42,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:18:42,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:18:42,271 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 79 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:42,310 INFO L93 Difference]: Finished difference Result 210 states and 365 transitions. [2024-11-16 13:18:42,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:18:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2024-11-16 13:18:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:42,330 INFO L225 Difference]: With dead ends: 210 [2024-11-16 13:18:42,330 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 13:18:42,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-16 13:18:42,344 INFO L432 NwaCegarLoop]: 159 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, 159 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-16 13:18:42,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:18:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 13:18:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-16 13:18:42,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.445945945945946) internal successors, (107), 74 states have internal predecessors, (107), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:18:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 163 transitions. [2024-11-16 13:18:42,391 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 163 transitions. Word has length 183 [2024-11-16 13:18:42,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:42,391 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 163 transitions. [2024-11-16 13:18:42,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 163 transitions. [2024-11-16 13:18:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 13:18:42,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:42,395 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:42,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 13:18:42,396 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:42,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:42,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1342431516, now seen corresponding path program 1 times [2024-11-16 13:18:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:42,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80211883] [2024-11-16 13:18:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:42,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:42,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:42,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:43,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80211883] [2024-11-16 13:18:43,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80211883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:43,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:43,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:18:43,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25244361] [2024-11-16 13:18:43,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:43,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:18:43,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:18:43,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:18:43,031 INFO L87 Difference]: Start difference. First operand 104 states and 163 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:43,114 INFO L93 Difference]: Finished difference Result 306 states and 483 transitions. [2024-11-16 13:18:43,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:18:43,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 13:18:43,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:43,119 INFO L225 Difference]: With dead ends: 306 [2024-11-16 13:18:43,119 INFO L226 Difference]: Without dead ends: 205 [2024-11-16 13:18:43,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-16 13:18:43,124 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 97 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:43,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 316 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:18:43,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-16 13:18:43,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2024-11-16 13:18:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 143 states have internal predecessors, (205), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:18:43,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 317 transitions. [2024-11-16 13:18:43,171 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 317 transitions. Word has length 183 [2024-11-16 13:18:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:43,172 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 317 transitions. [2024-11-16 13:18:43,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,176 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 317 transitions. [2024-11-16 13:18:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 13:18:43,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:43,183 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:43,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 13:18:43,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:43,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:43,188 INFO L85 PathProgramCache]: Analyzing trace with hash 876729989, now seen corresponding path program 1 times [2024-11-16 13:18:43,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:43,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170355402] [2024-11-16 13:18:43,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:43,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:43,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:43,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:43,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:43,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170355402] [2024-11-16 13:18:43,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170355402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:43,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:18:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113072178] [2024-11-16 13:18:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:43,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:18:43,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:43,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:18:43,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:18:43,367 INFO L87 Difference]: Start difference. First operand 202 states and 317 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:43,435 INFO L93 Difference]: Finished difference Result 468 states and 729 transitions. [2024-11-16 13:18:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:18:43,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-16 13:18:43,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:43,440 INFO L225 Difference]: With dead ends: 468 [2024-11-16 13:18:43,442 INFO L226 Difference]: Without dead ends: 269 [2024-11-16 13:18:43,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-16 13:18:43,446 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 45 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:43,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 333 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:18:43,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-16 13:18:43,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 220. [2024-11-16 13:18:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 161 states have (on average 1.434782608695652) internal successors, (231), 161 states have internal predecessors, (231), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:18:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 343 transitions. [2024-11-16 13:18:43,476 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 343 transitions. Word has length 184 [2024-11-16 13:18:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:43,477 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 343 transitions. [2024-11-16 13:18:43,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 343 transitions. [2024-11-16 13:18:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 13:18:43,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:43,479 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:43,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 13:18:43,480 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:43,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:43,480 INFO L85 PathProgramCache]: Analyzing trace with hash 652994468, now seen corresponding path program 1 times [2024-11-16 13:18:43,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:43,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458474015] [2024-11-16 13:18:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:43,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:43,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:43,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458474015] [2024-11-16 13:18:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458474015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:43,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:43,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:18:43,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094886856] [2024-11-16 13:18:43,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:43,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:18:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:18:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:18:43,664 INFO L87 Difference]: Start difference. First operand 220 states and 343 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:43,779 INFO L93 Difference]: Finished difference Result 646 states and 1013 transitions. [2024-11-16 13:18:43,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 13:18:43,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-16 13:18:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:43,786 INFO L225 Difference]: With dead ends: 646 [2024-11-16 13:18:43,788 INFO L226 Difference]: Without dead ends: 429 [2024-11-16 13:18:43,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-16 13:18:43,790 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 147 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:43,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 432 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:18:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-16 13:18:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2024-11-16 13:18:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 309 states have (on average 1.4271844660194175) internal successors, (441), 309 states have internal predecessors, (441), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-11-16 13:18:43,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 665 transitions. [2024-11-16 13:18:43,846 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 665 transitions. Word has length 184 [2024-11-16 13:18:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:43,847 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 665 transitions. [2024-11-16 13:18:43,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:43,847 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 665 transitions. [2024-11-16 13:18:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 13:18:43,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:43,851 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 13:18:43,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:43,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash 933491800, now seen corresponding path program 1 times [2024-11-16 13:18:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394723136] [2024-11-16 13:18:43,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:44,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:44,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394723136] [2024-11-16 13:18:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394723136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:18:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817484497] [2024-11-16 13:18:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:44,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:18:44,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:44,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:18:44,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:18:44,311 INFO L87 Difference]: Start difference. First operand 426 states and 665 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:44,891 INFO L93 Difference]: Finished difference Result 1283 states and 2007 transitions. [2024-11-16 13:18:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 13:18:44,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 185 [2024-11-16 13:18:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:44,900 INFO L225 Difference]: With dead ends: 1283 [2024-11-16 13:18:44,900 INFO L226 Difference]: Without dead ends: 1070 [2024-11-16 13:18:44,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:18:44,903 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 438 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:44,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 688 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 13:18:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-11-16 13:18:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1056. [2024-11-16 13:18:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 765 states have (on average 1.4366013071895425) internal successors, (1099), 765 states have internal predecessors, (1099), 280 states have call successors, (280), 10 states have call predecessors, (280), 10 states have return successors, (280), 280 states have call predecessors, (280), 280 states have call successors, (280) [2024-11-16 13:18:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1659 transitions. [2024-11-16 13:18:44,977 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1659 transitions. Word has length 185 [2024-11-16 13:18:44,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:44,977 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1659 transitions. [2024-11-16 13:18:44,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1659 transitions. [2024-11-16 13:18:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 13:18:44,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:44,980 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:44,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 13:18:44,980 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:44,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -771454984, now seen corresponding path program 1 times [2024-11-16 13:18:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82786023] [2024-11-16 13:18:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:44,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:46,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:46,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 81 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2024-11-16 13:18:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82786023] [2024-11-16 13:18:46,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82786023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 13:18:46,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714111040] [2024-11-16 13:18:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:18:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:18:46,372 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-16 13:18:46,376 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-16 13:18:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:46,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-16 13:18:46,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:18:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 934 proven. 177 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2024-11-16 13:18:48,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 13:18:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 111 proven. 195 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2024-11-16 13:18:49,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [714111040] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 13:18:49,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 13:18:49,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 15] total 35 [2024-11-16 13:18:49,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196250286] [2024-11-16 13:18:49,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 13:18:49,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-16 13:18:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:49,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-16 13:18:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=905, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 13:18:49,327 INFO L87 Difference]: Start difference. First operand 1056 states and 1659 transitions. Second operand has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 33 states have internal predecessors, (137), 12 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (72), 11 states have call predecessors, (72), 12 states have call successors, (72) [2024-11-16 13:18:51,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:51,168 INFO L93 Difference]: Finished difference Result 2172 states and 3259 transitions. [2024-11-16 13:18:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-16 13:18:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 33 states have internal predecessors, (137), 12 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (72), 11 states have call predecessors, (72), 12 states have call successors, (72) Word has length 185 [2024-11-16 13:18:51,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:51,175 INFO L225 Difference]: With dead ends: 2172 [2024-11-16 13:18:51,175 INFO L226 Difference]: Without dead ends: 1119 [2024-11-16 13:18:51,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1073, Invalid=2709, Unknown=0, NotChecked=0, Total=3782 [2024-11-16 13:18:51,180 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 742 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:51,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [742 Valid, 728 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 13:18:51,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-11-16 13:18:51,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1062. [2024-11-16 13:18:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 815 states have (on average 1.3680981595092025) internal successors, (1115), 821 states have internal predecessors, (1115), 204 states have call successors, (204), 42 states have call predecessors, (204), 42 states have return successors, (204), 198 states have call predecessors, (204), 204 states have call successors, (204) [2024-11-16 13:18:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1523 transitions. [2024-11-16 13:18:51,315 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1523 transitions. Word has length 185 [2024-11-16 13:18:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:51,316 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1523 transitions. [2024-11-16 13:18:51,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.029411764705882) internal successors, (137), 33 states have internal predecessors, (137), 12 states have call successors, (71), 6 states have call predecessors, (71), 13 states have return successors, (72), 11 states have call predecessors, (72), 12 states have call successors, (72) [2024-11-16 13:18:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1523 transitions. [2024-11-16 13:18:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:18:51,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:51,319 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:51,333 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-16 13:18:51,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 13:18:51,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:51,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:51,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1325698626, now seen corresponding path program 1 times [2024-11-16 13:18:51,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:51,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718247304] [2024-11-16 13:18:51,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:51,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:51,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718247304] [2024-11-16 13:18:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718247304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:51,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 13:18:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282718883] [2024-11-16 13:18:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:51,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 13:18:51,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:51,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 13:18:51,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 13:18:51,734 INFO L87 Difference]: Start difference. First operand 1062 states and 1523 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:51,952 INFO L93 Difference]: Finished difference Result 1606 states and 2310 transitions. [2024-11-16 13:18:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 13:18:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-16 13:18:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:51,959 INFO L225 Difference]: With dead ends: 1606 [2024-11-16 13:18:51,960 INFO L226 Difference]: Without dead ends: 1073 [2024-11-16 13:18:51,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:18:51,962 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 105 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:51,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 690 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 13:18:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-16 13:18:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 718. [2024-11-16 13:18:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 553 states have (on average 1.3688969258589512) internal successors, (757), 557 states have internal predecessors, (757), 136 states have call successors, (136), 28 states have call predecessors, (136), 28 states have return successors, (136), 132 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-16 13:18:52,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1029 transitions. [2024-11-16 13:18:52,045 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1029 transitions. Word has length 186 [2024-11-16 13:18:52,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:52,046 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1029 transitions. [2024-11-16 13:18:52,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:52,046 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1029 transitions. [2024-11-16 13:18:52,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:18:52,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:52,048 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:52,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 13:18:52,048 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:52,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:52,048 INFO L85 PathProgramCache]: Analyzing trace with hash -868755413, now seen corresponding path program 1 times [2024-11-16 13:18:52,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:52,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822193516] [2024-11-16 13:18:52,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:52,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:52,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822193516] [2024-11-16 13:18:52,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822193516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 13:18:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740552194] [2024-11-16 13:18:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:52,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 13:18:52,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:52,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 13:18:52,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:18:52,264 INFO L87 Difference]: Start difference. First operand 718 states and 1029 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:52,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:52,824 INFO L93 Difference]: Finished difference Result 2179 states and 3113 transitions. [2024-11-16 13:18:52,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 13:18:52,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-16 13:18:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:52,832 INFO L225 Difference]: With dead ends: 2179 [2024-11-16 13:18:52,832 INFO L226 Difference]: Without dead ends: 1998 [2024-11-16 13:18:52,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-16 13:18:52,834 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 425 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:52,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 599 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 13:18:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1998 states. [2024-11-16 13:18:52,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1998 to 1736. [2024-11-16 13:18:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1325 states have (on average 1.3577358490566038) internal successors, (1799), 1335 states have internal predecessors, (1799), 340 states have call successors, (340), 70 states have call predecessors, (340), 70 states have return successors, (340), 330 states have call predecessors, (340), 340 states have call successors, (340) [2024-11-16 13:18:52,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2479 transitions. [2024-11-16 13:18:52,950 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2479 transitions. Word has length 186 [2024-11-16 13:18:52,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:52,950 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2479 transitions. [2024-11-16 13:18:52,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2479 transitions. [2024-11-16 13:18:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:18:52,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:52,953 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 13:18:52,953 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash -665972284, now seen corresponding path program 1 times [2024-11-16 13:18:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174770521] [2024-11-16 13:18:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174770521] [2024-11-16 13:18:53,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174770521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:53,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:53,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 13:18:53,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113064023] [2024-11-16 13:18:53,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 13:18:53,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 13:18:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:18:53,175 INFO L87 Difference]: Start difference. First operand 1736 states and 2479 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:53,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:53,536 INFO L93 Difference]: Finished difference Result 3446 states and 4942 transitions. [2024-11-16 13:18:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:18:53,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-16 13:18:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:53,547 INFO L225 Difference]: With dead ends: 3446 [2024-11-16 13:18:53,548 INFO L226 Difference]: Without dead ends: 2572 [2024-11-16 13:18:53,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 13:18:53,551 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 272 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:53,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 601 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 13:18:53,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2024-11-16 13:18:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2354. [2024-11-16 13:18:53,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2354 states, 1807 states have (on average 1.3674598782512453) internal successors, (2471), 1817 states have internal predecessors, (2471), 452 states have call successors, (452), 94 states have call predecessors, (452), 94 states have return successors, (452), 442 states have call predecessors, (452), 452 states have call successors, (452) [2024-11-16 13:18:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2354 states to 2354 states and 3375 transitions. [2024-11-16 13:18:53,790 INFO L78 Accepts]: Start accepts. Automaton has 2354 states and 3375 transitions. Word has length 186 [2024-11-16 13:18:53,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:53,791 INFO L471 AbstractCegarLoop]: Abstraction has 2354 states and 3375 transitions. [2024-11-16 13:18:53,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:53,792 INFO L276 IsEmpty]: Start isEmpty. Operand 2354 states and 3375 transitions. [2024-11-16 13:18:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-16 13:18:53,794 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:53,794 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:53,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 13:18:53,794 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -150701263, now seen corresponding path program 1 times [2024-11-16 13:18:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:53,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596432002] [2024-11-16 13:18:53,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:53,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596432002] [2024-11-16 13:18:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596432002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:54,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 13:18:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710430768] [2024-11-16 13:18:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:54,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:18:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:18:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:18:54,070 INFO L87 Difference]: Start difference. First operand 2354 states and 3375 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:54,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:54,719 INFO L93 Difference]: Finished difference Result 4731 states and 6775 transitions. [2024-11-16 13:18:54,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 13:18:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-16 13:18:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:54,731 INFO L225 Difference]: With dead ends: 4731 [2024-11-16 13:18:54,731 INFO L226 Difference]: Without dead ends: 2380 [2024-11-16 13:18:54,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-16 13:18:54,738 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 451 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:54,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 753 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 13:18:54,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2380 states. [2024-11-16 13:18:54,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2380 to 2358. [2024-11-16 13:18:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1811 states have (on average 1.3649917172832688) internal successors, (2472), 1821 states have internal predecessors, (2472), 452 states have call successors, (452), 94 states have call predecessors, (452), 94 states have return successors, (452), 442 states have call predecessors, (452), 452 states have call successors, (452) [2024-11-16 13:18:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3376 transitions. [2024-11-16 13:18:54,900 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3376 transitions. Word has length 186 [2024-11-16 13:18:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:54,900 INFO L471 AbstractCegarLoop]: Abstraction has 2358 states and 3376 transitions. [2024-11-16 13:18:54,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:18:54,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3376 transitions. [2024-11-16 13:18:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-16 13:18:54,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:54,902 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:54,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 13:18:54,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:54,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:54,903 INFO L85 PathProgramCache]: Analyzing trace with hash 2003628533, now seen corresponding path program 1 times [2024-11-16 13:18:54,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:54,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474555044] [2024-11-16 13:18:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 13:18:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 13:18:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 13:18:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 13:18:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 13:18:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 13:18:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 13:18:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 13:18:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 13:18:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 13:18:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 13:18:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 13:18:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 13:18:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 13:18:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 13:18:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 13:18:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 13:18:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 13:18:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 13:18:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 13:18:55,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 13:18:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 13:18:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 13:18:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 13:18:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 13:18:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 13:18:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 13:18:55,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 13:18:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:18:55,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:18:55,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 13:18:55,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474555044] [2024-11-16 13:18:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474555044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:18:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:18:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 13:18:55,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933650624] [2024-11-16 13:18:55,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:18:55,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 13:18:55,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 13:18:55,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 13:18:55,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 13:18:55,235 INFO L87 Difference]: Start difference. First operand 2358 states and 3376 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:18:56,275 INFO L93 Difference]: Finished difference Result 3711 states and 5321 transitions. [2024-11-16 13:18:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 13:18:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-16 13:18:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:18:56,286 INFO L225 Difference]: With dead ends: 3711 [2024-11-16 13:18:56,286 INFO L226 Difference]: Without dead ends: 2468 [2024-11-16 13:18:56,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-16 13:18:56,290 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 275 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:18:56,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1280 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 13:18:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2024-11-16 13:18:56,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 2356. [2024-11-16 13:18:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1809 states have (on average 1.3642896627971255) internal successors, (2468), 1819 states have internal predecessors, (2468), 452 states have call successors, (452), 94 states have call predecessors, (452), 94 states have return successors, (452), 442 states have call predecessors, (452), 452 states have call successors, (452) [2024-11-16 13:18:56,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3372 transitions. [2024-11-16 13:18:56,439 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3372 transitions. Word has length 187 [2024-11-16 13:18:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:18:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3372 transitions. [2024-11-16 13:18:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:18:56,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3372 transitions. [2024-11-16 13:18:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-16 13:18:56,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:18:56,441 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:18:56,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 13:18:56,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:18:56,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:18:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1130803656, now seen corresponding path program 1 times [2024-11-16 13:18:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 13:18:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214221958] [2024-11-16 13:18:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 13:18:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 13:18:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1649031023] [2024-11-16 13:18:56,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:18:56,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 13:18:56,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:18:56,482 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-16 13:18:56,483 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-16 13:18:56,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:18:56,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 13:18:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 13:18:56,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 13:18:56,702 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 13:18:56,703 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 13:18:56,719 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-16 13:18:56,908 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,SelfDestructingSolverStorable11 [2024-11-16 13:18:56,911 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 13:18:57,010 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 13:18:57,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 01:18:57 BoogieIcfgContainer [2024-11-16 13:18:57,016 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 13:18:57,017 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 13:18:57,017 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 13:18:57,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 13:18:57,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:18:41" (3/4) ... [2024-11-16 13:18:57,020 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 13:18:57,021 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 13:18:57,021 INFO L158 Benchmark]: Toolchain (without parser) took 16399.83ms. Allocated memory was 138.4MB in the beginning and 530.6MB in the end (delta: 392.2MB). Free memory was 66.8MB in the beginning and 183.4MB in the end (delta: -116.6MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,021 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 20.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:18:57,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.20ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 66.7MB in the beginning and 171.0MB in the end (delta: -104.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,022 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.08ms. Allocated memory is still 213.9MB. Free memory was 171.0MB in the beginning and 165.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,022 INFO L158 Benchmark]: Boogie Preprocessor took 79.17ms. Allocated memory is still 213.9MB. Free memory was 165.8MB in the beginning and 160.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,022 INFO L158 Benchmark]: IcfgBuilder took 561.41ms. Allocated memory is still 213.9MB. Free memory was 160.5MB in the beginning and 128.1MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,022 INFO L158 Benchmark]: TraceAbstraction took 15293.68ms. Allocated memory was 213.9MB in the beginning and 530.6MB in the end (delta: 316.7MB). Free memory was 126.9MB in the beginning and 184.5MB in the end (delta: -57.5MB). Peak memory consumption was 259.0MB. Max. memory is 16.1GB. [2024-11-16 13:18:57,022 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 530.6MB. Free memory was 184.5MB in the beginning and 183.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 13:18:57,023 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 101.6MB in the beginning and 101.6MB in the end (delta: 20.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.20ms. Allocated memory was 138.4MB in the beginning and 213.9MB in the end (delta: 75.5MB). Free memory was 66.7MB in the beginning and 171.0MB in the end (delta: -104.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.08ms. Allocated memory is still 213.9MB. Free memory was 171.0MB in the beginning and 165.8MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.17ms. Allocated memory is still 213.9MB. Free memory was 165.8MB in the beginning and 160.5MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 561.41ms. Allocated memory is still 213.9MB. Free memory was 160.5MB in the beginning and 128.1MB in the end (delta: 32.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15293.68ms. Allocated memory was 213.9MB in the beginning and 530.6MB in the end (delta: 316.7MB). Free memory was 126.9MB in the beginning and 184.5MB in the end (delta: -57.5MB). Peak memory consumption was 259.0MB. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 530.6MB. Free memory was 184.5MB in the beginning and 183.4MB in the end (delta: 1.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 someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of bitwiseOr at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] unsigned short int var_1_25 = 2; [L39] unsigned short int var_1_26 = 1; [L40] unsigned short int var_1_27 = 64; [L41] signed long int var_1_28 = -4; [L42] unsigned long int var_1_29 = 10; [L43] unsigned char var_1_30 = 4; [L44] unsigned char var_1_31 = 16; [L45] signed long int var_1_32 = 8; [L46] float var_1_33 = 24.55; [L47] signed long int var_1_34 = 5; [L48] unsigned short int var_1_35 = 256; [L49] unsigned char var_1_36 = 0; [L50] unsigned long int last_1_var_1_10 = 256; [L51] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L172] isInitial = 1 [L173] FCALL initially() [L174] COND TRUE 1 [L175] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=1, var_1_5=-32, var_1_6=256] [L175] RET updateLastVariables() [L176] CALL updateVariables() [L119] var_1_3 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L120] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_5=-32, var_1_6=256] [L121] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L121] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-32, var_1_6=256] [L122] var_1_5 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L123] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L124] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L124] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L125] var_1_13 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L126] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L127] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L127] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L128] var_1_14 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L129] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L130] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L130] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L131] var_1_15 = __VERIFIER_nondet_double() [L132] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L132] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L133] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L133] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L134] var_1_16 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L135] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L136] var_1_21 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L137] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L138] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L138] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L139] var_1_22 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L140] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L141] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L141] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_25=2, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L142] var_1_25 = __VERIFIER_nondet_ushort() [L143] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L143] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L144] CALL assume_abort_if_not(var_1_25 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L144] RET assume_abort_if_not(var_1_25 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_26=1, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L145] var_1_26 = __VERIFIER_nondet_ushort() [L146] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L146] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L147] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L147] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_27=64, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L148] var_1_27 = __VERIFIER_nondet_ushort() [L149] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L149] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L150] CALL assume_abort_if_not(var_1_27 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L150] RET assume_abort_if_not(var_1_27 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=16, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L151] var_1_31 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L152] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_31 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L153] RET assume_abort_if_not(var_1_31 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_33=491/20, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L154] var_1_33 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L155] RET assume_abort_if_not((var_1_33 >= -922337.2036854776000e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854776000e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=5, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L156] var_1_34 = __VERIFIER_nondet_long() [L157] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L157] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L158] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=0, var_1_3=0, var_1_5=-63, var_1_6=256] [L159] var_1_36 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-63, var_1_6=256] [L160] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_3=0, var_1_5=-63, var_1_6=256] [L161] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L161] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=5, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L176] RET updateVariables() [L177] CALL step() [L55] COND TRUE var_1_25 >= ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L56] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=-4, var_1_29=10, var_1_30=4, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L58] var_1_28 = var_1_27 [L59] var_1_29 = var_1_26 [L60] var_1_30 = var_1_31 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=8, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L61] COND FALSE !(((((1.25f) < 0 ) ? -(1.25f) : (1.25f))) != var_1_33) [L68] var_1_32 = var_1_30 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=256, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L70] COND TRUE \read(var_1_36) [L71] var_1_35 = ((((var_1_30) > (((((128) < 0 ) ? -(128) : (128))))) ? (var_1_30) : (((((128) < 0 ) ? -(128) : (128)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L73] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L78] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-8001, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L79] COND TRUE stepLocal_2 > last_1_var_1_10 [L80] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L82] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L87] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=72, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L88] COND FALSE !(stepLocal_1 || var_1_3) [L93] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L95] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L106] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L111] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L111] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L112] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L177] RET step() [L178] CALL, EXPR property() [L168] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L168-L169] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L178] RET, EXPR property() [L178] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=72, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_34=-2147483648, var_1_35=128, var_1_36=1, var_1_3=0, var_1_5=-63, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 12, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2997 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2997 mSDsluCounter, 6579 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4498 mSDsCounter, 1133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2851 IncrementalHoareTripleChecker+Invalid, 3984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1133 mSolverCounterUnsat, 2081 mSDtfsCounter, 2851 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1134 GetRequests, 1017 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2358occurred in iteration=10, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1095 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2594 NumberOfCodeBlocks, 2594 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 12033 SizeOfPredicates, 6 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 19203/19656 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-16 13:18:57,061 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_fillercode_fillercodesize_ps-cn-25_file-3.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 fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 13:18:59,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 13:18:59,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 13:18:59,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 13:18:59,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 13:18:59,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 13:18:59,497 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 13:18:59,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 13:18:59,498 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 13:18:59,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 13:18:59,499 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 13:18:59,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 13:18:59,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 13:18:59,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 13:18:59,502 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 13:18:59,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 13:18:59,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 13:18:59,503 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 13:18:59,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 13:18:59,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 13:18:59,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 13:18:59,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 13:18:59,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 13:18:59,507 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 13:18:59,507 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 13:18:59,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 13:18:59,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:18:59,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 13:18:59,509 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 13:18:59,510 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 13:18:59,510 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 13:18:59,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 13:18:59,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 13:18:59,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 13:18:59,511 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 -> fcab9d14a39efb8d0bba4b7e607a800a4978f63d5ac50f5af469476854f605eb [2024-11-16 13:18:59,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 13:18:59,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 13:18:59,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 13:18:59,820 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 13:18:59,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 13:18:59,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:19:01,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 13:19:01,250 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-16 13:19:01,459 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 13:19:01,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:19:01,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5f3984c/6b5e87869e73462f94f50f4e508a8446/FLAGc674f92a8 [2024-11-16 13:19:01,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf5f3984c/6b5e87869e73462f94f50f4e508a8446 [2024-11-16 13:19:01,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 13:19:01,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 13:19:01,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 13:19:01,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 13:19:01,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 13:19:01,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:19:01" (1/1) ... [2024-11-16 13:19:01,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31673a36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:01, skipping insertion in model container [2024-11-16 13:19:01,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 01:19:01" (1/1) ... [2024-11-16 13:19:01,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 13:19:01,960 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_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-11-16 13:19:02,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:19:02,059 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 13:19:02,079 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_fillercode_fillercodesize_ps-cn-25_file-3.i[914,927] [2024-11-16 13:19:02,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 13:19:02,138 INFO L204 MainTranslator]: Completed translation [2024-11-16 13:19:02,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02 WrapperNode [2024-11-16 13:19:02,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 13:19:02,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 13:19:02,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 13:19:02,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 13:19:02,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,197 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-16 13:19:02,198 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 13:19:02,198 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 13:19:02,198 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 13:19:02,199 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 13:19:02,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,229 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-16 13:19:02,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,248 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,254 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 13:19:02,255 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 13:19:02,255 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 13:19:02,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 13:19:02,256 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (1/1) ... [2024-11-16 13:19:02,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 13:19:02,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 13:19:02,290 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-16 13:19:02,296 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-16 13:19:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 13:19:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 13:19:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 13:19:02,332 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 13:19:02,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 13:19:02,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 13:19:02,420 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 13:19:02,421 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 13:19:17,926 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 13:19:17,927 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 13:19:17,938 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 13:19:17,938 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 13:19:17,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:19:17 BoogieIcfgContainer [2024-11-16 13:19:17,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 13:19:17,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 13:19:17,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 13:19:17,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 13:19:17,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 01:19:01" (1/3) ... [2024-11-16 13:19:17,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9d96a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:19:17, skipping insertion in model container [2024-11-16 13:19:17,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 01:19:02" (2/3) ... [2024-11-16 13:19:17,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d9d96a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 01:19:17, skipping insertion in model container [2024-11-16 13:19:17,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 01:19:17" (3/3) ... [2024-11-16 13:19:17,957 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-3.i [2024-11-16 13:19:17,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 13:19:17,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 13:19:18,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 13:19:18,032 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;@1b867877, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 13:19:18,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 13:19:18,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:19:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-16 13:19:18,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:18,053 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:18,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1488645010, now seen corresponding path program 1 times [2024-11-16 13:19:18,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:19:18,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879078981] [2024-11-16 13:19:18,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:18,072 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-16 13:19:18,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:19:18,075 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-16 13:19:18,075 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-16 13:19:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:19,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 13:19:19,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:19:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-16 13:19:19,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:19:19,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:19:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879078981] [2024-11-16 13:19:19,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879078981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:19:19,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:19:19,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 13:19:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780410138] [2024-11-16 13:19:19,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:19:19,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 13:19:19,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:19:19,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 13:19:19,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 13:19:19,170 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:19:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:19:19,192 INFO L93 Difference]: Finished difference Result 168 states and 295 transitions. [2024-11-16 13:19:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 13:19:19,198 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-11-16 13:19:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:19:19,205 INFO L225 Difference]: With dead ends: 168 [2024-11-16 13:19:19,205 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 13:19:19,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-16 13:19:19,210 INFO L432 NwaCegarLoop]: 128 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, 128 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-16 13:19:19,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 13:19:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 13:19:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 13:19:19,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 13:19:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-16 13:19:19,249 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 180 [2024-11-16 13:19:19,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:19:19,249 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-16 13:19:19,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 13:19:19,250 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-16 13:19:19,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-16 13:19:19,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:19:19,262 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:19:19,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 13:19:19,466 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-16 13:19:19,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:19:19,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:19:19,469 INFO L85 PathProgramCache]: Analyzing trace with hash -422213360, now seen corresponding path program 1 times [2024-11-16 13:19:19,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:19:19,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194233004] [2024-11-16 13:19:19,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:19:19,470 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-16 13:19:19,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:19:19,473 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-16 13:19:19,474 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-16 13:19:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:19:20,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 13:19:20,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:19:24,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:19:24,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:19:24,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:19:24,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194233004] [2024-11-16 13:19:24,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194233004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:19:24,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:19:24,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:19:24,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725879727] [2024-11-16 13:19:24,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:19:24,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 13:19:24,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:19:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 13:19:24,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 13:19:24,948 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:19:29,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:33,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:37,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:41,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:45,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:50,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:51,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:19:57,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:20:01,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:20:05,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 13:20:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 13:20:05,775 INFO L93 Difference]: Finished difference Result 243 states and 378 transitions. [2024-11-16 13:20:05,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 13:20:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-16 13:20:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 13:20:05,900 INFO L225 Difference]: With dead ends: 243 [2024-11-16 13:20:05,900 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 13:20:05,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 13:20:05,901 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 36 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2024-11-16 13:20:05,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 395 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 8 Unknown, 0 Unchecked, 40.7s Time] [2024-11-16 13:20:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 13:20:05,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-16 13:20:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.3465346534653466) internal successors, (136), 101 states have internal predecessors, (136), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 13:20:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2024-11-16 13:20:05,938 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 180 [2024-11-16 13:20:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 13:20:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2024-11-16 13:20:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:20:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2024-11-16 13:20:05,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-16 13:20:05,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 13:20:05,949 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 13:20:05,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 13:20:06,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 13:20:06,151 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 13:20:06,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 13:20:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1859201643, now seen corresponding path program 1 times [2024-11-16 13:20:06,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 13:20:06,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65287061] [2024-11-16 13:20:06,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 13:20:06,152 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-16 13:20:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 13:20:06,155 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 13:20:06,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 13:20:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 13:20:07,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 13:20:07,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 13:20:07,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 13:20:07,271 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 13:20:07,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 13:20:07,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65287061] [2024-11-16 13:20:07,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65287061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 13:20:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 13:20:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 13:20:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94725222] [2024-11-16 13:20:07,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 13:20:07,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 13:20:07,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 13:20:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 13:20:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 13:20:07,278 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 13:20:11,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []