./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.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 0bef9603856cb87254a0fac59ed35f7753088518d4df6d817dae75a7c6158cf8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:16:36,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:16:36,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:16:36,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:16:36,559 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:16:36,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:16:36,585 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:16:36,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:16:36,586 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:16:36,587 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:16:36,587 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:16:36,587 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:16:36,588 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:16:36,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:16:36,590 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:16:36,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:16:36,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:16:36,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:16:36,591 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:16:36,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:16:36,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:16:36,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:16:36,594 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:16:36,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:16:36,595 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:16:36,595 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:16:36,595 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:16:36,595 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:16:36,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:16:36,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:16:36,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:16:36,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:16:36,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:16:36,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:16:36,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:16:36,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:16:36,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:16:36,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:16:36,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:16:36,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:16:36,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:16:36,599 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:16:36,599 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 -> 0bef9603856cb87254a0fac59ed35f7753088518d4df6d817dae75a7c6158cf8 [2024-11-10 07:16:36,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:16:36,829 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:16:36,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:16:36,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:16:36,833 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:16:36,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:16:38,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:16:38,232 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:16:38,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:16:38,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df81752cb/f0ed150a849e460ea37afa20472f462b/FLAG9f4d14957 [2024-11-10 07:16:38,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df81752cb/f0ed150a849e460ea37afa20472f462b [2024-11-10 07:16:38,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:16:38,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:16:38,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:16:38,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:16:38,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:16:38,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:38,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c565e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38, skipping insertion in model container [2024-11-10 07:16:38,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:38,657 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:16:38,801 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_loopvsstraightlinecode_100-while_file-61.i[916,929] [2024-11-10 07:16:38,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:16:38,914 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:16:38,922 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_loopvsstraightlinecode_100-while_file-61.i[916,929] [2024-11-10 07:16:38,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:16:38,973 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:16:38,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38 WrapperNode [2024-11-10 07:16:38,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:16:38,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:16:38,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:16:38,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:16:38,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:38,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,027 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-10 07:16:39,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:16:39,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:16:39,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:16:39,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:16:39,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:16:39,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,083 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:16:39,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:16:39,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:16:39,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:16:39,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (1/1) ... [2024-11-10 07:16:39,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:16:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:16:39,127 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:16:39,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:16:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:16:39,164 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:16:39,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:16:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:16:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:16:39,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:16:39,243 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:16:39,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:16:39,629 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L197: havoc property_#t~bitwise20#1;havoc property_#t~short21#1;havoc property_#t~ite23#1;havoc property_#t~bitwise22#1;havoc property_#t~short24#1; [2024-11-10 07:16:39,664 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-10 07:16:39,664 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:16:39,684 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:16:39,685 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:16:39,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:16:39 BoogieIcfgContainer [2024-11-10 07:16:39,686 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:16:39,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:16:39,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:16:39,689 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:16:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:16:38" (1/3) ... [2024-11-10 07:16:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750c8e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:16:39, skipping insertion in model container [2024-11-10 07:16:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:16:38" (2/3) ... [2024-11-10 07:16:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@750c8e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:16:39, skipping insertion in model container [2024-11-10 07:16:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:16:39" (3/3) ... [2024-11-10 07:16:39,691 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:16:39,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:16:39,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:16:39,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:16:39,754 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;@4423f9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:16:39,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:16:39,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:16:39,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 07:16:39,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:39,769 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:39,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:39,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:39,773 INFO L85 PathProgramCache]: Analyzing trace with hash 708793512, now seen corresponding path program 1 times [2024-11-10 07:16:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:39,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477313128] [2024-11-10 07:16:39,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:39,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:40,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:40,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:40,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477313128] [2024-11-10 07:16:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477313128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:40,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:40,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:16:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451672948] [2024-11-10 07:16:40,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:40,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:16:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:40,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:16:40,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:16:40,183 INFO L87 Difference]: Start difference. First operand has 109 states, 80 states have (on average 1.4625) internal successors, (117), 81 states have internal predecessors, (117), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:16:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:40,258 INFO L93 Difference]: Finished difference Result 210 states and 357 transitions. [2024-11-10 07:16:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:16:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 177 [2024-11-10 07:16:40,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:40,268 INFO L225 Difference]: With dead ends: 210 [2024-11-10 07:16:40,268 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 07:16:40,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:16:40,278 INFO L432 NwaCegarLoop]: 157 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, 157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:40,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:16:40,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 07:16:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-10 07:16:40,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:16:40,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2024-11-10 07:16:40,328 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 177 [2024-11-10 07:16:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:40,329 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2024-11-10 07:16:40,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:16:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2024-11-10 07:16:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 07:16:40,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:40,335 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:40,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:16:40,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:40,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1083232564, now seen corresponding path program 1 times [2024-11-10 07:16:40,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:40,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54254327] [2024-11-10 07:16:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:40,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:40,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:40,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:40,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:40,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54254327] [2024-11-10 07:16:40,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54254327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:40,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:40,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:16:40,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874430595] [2024-11-10 07:16:40,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:40,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:16:40,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:16:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:16:40,927 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:41,022 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-10 07:16:41,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:16:41,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 07:16:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:41,024 INFO L225 Difference]: With dead ends: 209 [2024-11-10 07:16:41,024 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 07:16:41,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:16:41,026 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 96 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:41,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 179 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:16:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 07:16:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 07:16:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:16:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2024-11-10 07:16:41,039 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 177 [2024-11-10 07:16:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:41,040 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 163 transitions. [2024-11-10 07:16:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 163 transitions. [2024-11-10 07:16:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 07:16:41,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:41,044 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:41,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:16:41,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:41,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:41,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1858425035, now seen corresponding path program 1 times [2024-11-10 07:16:41,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:41,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159196861] [2024-11-10 07:16:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:43,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:43,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:43,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159196861] [2024-11-10 07:16:43,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159196861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:43,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:16:43,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387088698] [2024-11-10 07:16:43,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:43,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:16:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:16:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:16:43,482 INFO L87 Difference]: Start difference. First operand 108 states and 163 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:45,183 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2024-11-10 07:16:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:16:45,184 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2024-11-10 07:16:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:45,189 INFO L225 Difference]: With dead ends: 472 [2024-11-10 07:16:45,189 INFO L226 Difference]: Without dead ends: 367 [2024-11-10 07:16:45,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 07:16:45,191 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 858 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:45,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 669 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 07:16:45,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-10 07:16:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 205. [2024-11-10 07:16:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 148 states have (on average 1.4256756756756757) internal successors, (211), 148 states have internal predecessors, (211), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 07:16:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2024-11-10 07:16:45,238 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 177 [2024-11-10 07:16:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:45,240 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2024-11-10 07:16:45,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2024-11-10 07:16:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:16:45,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:45,245 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:16:45,245 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:45,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1933645649, now seen corresponding path program 1 times [2024-11-10 07:16:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:45,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951063964] [2024-11-10 07:16:45,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:45,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:46,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:46,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951063964] [2024-11-10 07:16:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951063964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:46,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:46,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:16:46,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355678732] [2024-11-10 07:16:46,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:46,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:16:46,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:46,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:16:46,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:46,607 INFO L87 Difference]: Start difference. First operand 205 states and 315 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:46,934 INFO L93 Difference]: Finished difference Result 392 states and 593 transitions. [2024-11-10 07:16:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:16:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 07:16:46,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:46,938 INFO L225 Difference]: With dead ends: 392 [2024-11-10 07:16:46,938 INFO L226 Difference]: Without dead ends: 287 [2024-11-10 07:16:46,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:16:46,939 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 151 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:46,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 501 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:16:46,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-10 07:16:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 223. [2024-11-10 07:16:46,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 166 states have (on average 1.4397590361445782) internal successors, (239), 166 states have internal predecessors, (239), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 07:16:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2024-11-10 07:16:46,956 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 178 [2024-11-10 07:16:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:46,956 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2024-11-10 07:16:46,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2024-11-10 07:16:46,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:16:46,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:46,958 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:16:46,958 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1292168775, now seen corresponding path program 1 times [2024-11-10 07:16:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858455060] [2024-11-10 07:16:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:47,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:47,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:47,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:47,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:47,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858455060] [2024-11-10 07:16:47,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858455060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:47,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:47,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:16:47,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023686033] [2024-11-10 07:16:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:47,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:16:47,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:16:47,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:47,426 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:47,973 INFO L93 Difference]: Finished difference Result 723 states and 1109 transitions. [2024-11-10 07:16:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:16:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 07:16:47,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:47,976 INFO L225 Difference]: With dead ends: 723 [2024-11-10 07:16:47,977 INFO L226 Difference]: Without dead ends: 579 [2024-11-10 07:16:47,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:16:47,980 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 249 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:47,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 754 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:16:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-10 07:16:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 521. [2024-11-10 07:16:48,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 436 states have (on average 1.5022935779816513) internal successors, (655), 436 states have internal predecessors, (655), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:48,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-10 07:16:48,024 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-10 07:16:48,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:48,025 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-10 07:16:48,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-10 07:16:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 07:16:48,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:48,028 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:48,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:16:48,028 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:48,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:48,029 INFO L85 PathProgramCache]: Analyzing trace with hash -863937951, now seen corresponding path program 1 times [2024-11-10 07:16:48,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:48,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55503036] [2024-11-10 07:16:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:48,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:49,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:49,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:49,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:49,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:49,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55503036] [2024-11-10 07:16:49,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55503036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:49,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:49,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:16:49,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201318598] [2024-11-10 07:16:49,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:49,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:16:49,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:49,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:16:49,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:16:49,070 INFO L87 Difference]: Start difference. First operand 521 states and 811 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:49,371 INFO L93 Difference]: Finished difference Result 992 states and 1537 transitions. [2024-11-10 07:16:49,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:16:49,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 178 [2024-11-10 07:16:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:49,376 INFO L225 Difference]: With dead ends: 992 [2024-11-10 07:16:49,378 INFO L226 Difference]: Without dead ends: 649 [2024-11-10 07:16:49,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:49,379 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 98 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:49,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 510 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:16:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-10 07:16:49,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 521. [2024-11-10 07:16:49,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 436 states have (on average 1.5022935779816513) internal successors, (655), 436 states have internal predecessors, (655), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:49,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-10 07:16:49,413 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-10 07:16:49,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:49,413 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-10 07:16:49,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:49,413 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-10 07:16:49,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-10 07:16:49,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:49,415 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:49,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:16:49,415 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:49,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:49,416 INFO L85 PathProgramCache]: Analyzing trace with hash -349669668, now seen corresponding path program 1 times [2024-11-10 07:16:49,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:49,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246341932] [2024-11-10 07:16:49,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:49,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:50,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:50,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:50,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:50,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:50,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:50,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:50,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246341932] [2024-11-10 07:16:50,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246341932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:50,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:50,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:16:50,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046356302] [2024-11-10 07:16:50,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:50,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:16:50,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:16:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:50,235 INFO L87 Difference]: Start difference. First operand 521 states and 811 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:50,531 INFO L93 Difference]: Finished difference Result 1057 states and 1611 transitions. [2024-11-10 07:16:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:16:50,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2024-11-10 07:16:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:50,535 INFO L225 Difference]: With dead ends: 1057 [2024-11-10 07:16:50,535 INFO L226 Difference]: Without dead ends: 700 [2024-11-10 07:16:50,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:16:50,536 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 135 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:50,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 524 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:16:50,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-10 07:16:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 493. [2024-11-10 07:16:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 408 states have (on average 1.4509803921568627) internal successors, (592), 408 states have internal predecessors, (592), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 748 transitions. [2024-11-10 07:16:50,562 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 748 transitions. Word has length 179 [2024-11-10 07:16:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:50,563 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 748 transitions. [2024-11-10 07:16:50,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 748 transitions. [2024-11-10 07:16:50,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-10 07:16:50,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:50,565 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:50,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:16:50,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:50,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:50,566 INFO L85 PathProgramCache]: Analyzing trace with hash -501087181, now seen corresponding path program 1 times [2024-11-10 07:16:50,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:50,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287798478] [2024-11-10 07:16:50,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:50,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:50,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:50,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:50,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287798478] [2024-11-10 07:16:50,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287798478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:50,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:50,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 07:16:50,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081293894] [2024-11-10 07:16:50,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:50,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 07:16:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:50,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 07:16:50,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:50,839 INFO L87 Difference]: Start difference. First operand 493 states and 748 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:50,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:50,974 INFO L93 Difference]: Finished difference Result 863 states and 1312 transitions. [2024-11-10 07:16:50,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:16:50,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 180 [2024-11-10 07:16:50,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:50,977 INFO L225 Difference]: With dead ends: 863 [2024-11-10 07:16:50,977 INFO L226 Difference]: Without dead ends: 486 [2024-11-10 07:16:50,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 07:16:50,979 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 79 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:50,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 396 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:16:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-10 07:16:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-10 07:16:51,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 401 states have (on average 1.428927680798005) internal successors, (573), 401 states have internal predecessors, (573), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 729 transitions. [2024-11-10 07:16:51,004 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 729 transitions. Word has length 180 [2024-11-10 07:16:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:51,005 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 729 transitions. [2024-11-10 07:16:51,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:51,005 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 729 transitions. [2024-11-10 07:16:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 07:16:51,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:51,008 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:51,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:16:51,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -959422466, now seen corresponding path program 1 times [2024-11-10 07:16:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:51,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860368538] [2024-11-10 07:16:51,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:51,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:51,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 07:16:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860368538] [2024-11-10 07:16:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860368538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:16:51,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299399237] [2024-11-10 07:16:51,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:16:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:16:51,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:16:51,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:16:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:51,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:16:51,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:16:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 25 proven. 75 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 07:16:51,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:16:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 07:16:51,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299399237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:16:51,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:16:51,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-10 07:16:51,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119723344] [2024-11-10 07:16:51,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:16:51,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:16:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:16:51,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:16:51,972 INFO L87 Difference]: Start difference. First operand 486 states and 729 transitions. Second operand has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-10 07:16:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:52,165 INFO L93 Difference]: Finished difference Result 848 states and 1254 transitions. [2024-11-10 07:16:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:16:52,166 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) Word has length 182 [2024-11-10 07:16:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:52,168 INFO L225 Difference]: With dead ends: 848 [2024-11-10 07:16:52,168 INFO L226 Difference]: Without dead ends: 468 [2024-11-10 07:16:52,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:16:52,171 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:52,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 283 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:16:52,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-10 07:16:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 456. [2024-11-10 07:16:52,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 368 states have (on average 1.3831521739130435) internal successors, (509), 368 states have internal predecessors, (509), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 665 transitions. [2024-11-10 07:16:52,196 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 665 transitions. Word has length 182 [2024-11-10 07:16:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:52,196 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 665 transitions. [2024-11-10 07:16:52,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.11111111111111) internal successors, (100), 9 states have internal predecessors, (100), 3 states have call successors, (76), 2 states have call predecessors, (76), 4 states have return successors, (77), 2 states have call predecessors, (77), 3 states have call successors, (77) [2024-11-10 07:16:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 665 transitions. [2024-11-10 07:16:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 07:16:52,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:52,199 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:52,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:16:52,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:16:52,404 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:52,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:52,405 INFO L85 PathProgramCache]: Analyzing trace with hash 823696142, now seen corresponding path program 1 times [2024-11-10 07:16:52,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:52,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476192327] [2024-11-10 07:16:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:52,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:52,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476192327] [2024-11-10 07:16:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476192327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:52,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:16:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509381130] [2024-11-10 07:16:52,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:52,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:16:52,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:52,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:16:52,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:16:52,552 INFO L87 Difference]: Start difference. First operand 456 states and 665 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:52,618 INFO L93 Difference]: Finished difference Result 979 states and 1427 transitions. [2024-11-10 07:16:52,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:16:52,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-11-10 07:16:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:52,621 INFO L225 Difference]: With dead ends: 979 [2024-11-10 07:16:52,621 INFO L226 Difference]: Without dead ends: 653 [2024-11-10 07:16:52,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:16:52,622 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 50 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:52,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 297 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:16:52,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-10 07:16:52,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 604. [2024-11-10 07:16:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.4186046511627908) internal successors, (732), 516 states have internal predecessors, (732), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 888 transitions. [2024-11-10 07:16:52,650 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 888 transitions. Word has length 182 [2024-11-10 07:16:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 888 transitions. [2024-11-10 07:16:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 888 transitions. [2024-11-10 07:16:52,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 07:16:52,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:52,652 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:52,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 07:16:52,652 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:52,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:52,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1038031961, now seen corresponding path program 1 times [2024-11-10 07:16:52,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:52,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263118147] [2024-11-10 07:16:52,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:52,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:52,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:52,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:52,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:52,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 07:16:52,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:52,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263118147] [2024-11-10 07:16:52,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263118147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:16:52,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:16:52,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:16:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906813087] [2024-11-10 07:16:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:16:52,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:16:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:52,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:16:52,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:16:52,890 INFO L87 Difference]: Start difference. First operand 604 states and 888 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:53,087 INFO L93 Difference]: Finished difference Result 1044 states and 1524 transitions. [2024-11-10 07:16:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:16:53,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 182 [2024-11-10 07:16:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:53,093 INFO L225 Difference]: With dead ends: 1044 [2024-11-10 07:16:53,093 INFO L226 Difference]: Without dead ends: 769 [2024-11-10 07:16:53,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:16:53,095 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 258 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:53,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 513 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:16:53,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-10 07:16:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 604. [2024-11-10 07:16:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 516 states have (on average 1.4166666666666667) internal successors, (731), 516 states have internal predecessors, (731), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:53,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 887 transitions. [2024-11-10 07:16:53,124 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 887 transitions. Word has length 182 [2024-11-10 07:16:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:53,125 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 887 transitions. [2024-11-10 07:16:53,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 07:16:53,125 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 887 transitions. [2024-11-10 07:16:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 07:16:53,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:53,126 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:53,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 07:16:53,126 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:53,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:53,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1948549355, now seen corresponding path program 1 times [2024-11-10 07:16:53,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:53,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305355744] [2024-11-10 07:16:53,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:53,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:16:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:16:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:16:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:16:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:16:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:16:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:16:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:16:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:16:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:16:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:16:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:16:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:16:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:16:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:16:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:16:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:16:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:16:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:16:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:16:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 07:16:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 07:16:53,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 07:16:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 07:16:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 07:16:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:16:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 07:16:53,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:16:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305355744] [2024-11-10 07:16:53,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305355744] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:16:53,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111019160] [2024-11-10 07:16:53,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:53,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:16:53,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:16:53,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:16:53,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:16:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:53,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 07:16:53,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:16:54,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 07:16:54,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:16:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 07:16:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111019160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:16:54,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:16:54,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-10 07:16:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846911039] [2024-11-10 07:16:54,471 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:16:54,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:16:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:16:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:16:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:16:54,473 INFO L87 Difference]: Start difference. First operand 604 states and 887 transitions. Second operand has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-10 07:16:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:16:55,472 INFO L93 Difference]: Finished difference Result 1479 states and 2087 transitions. [2024-11-10 07:16:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 07:16:55,472 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) Word has length 183 [2024-11-10 07:16:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:16:55,476 INFO L225 Difference]: With dead ends: 1479 [2024-11-10 07:16:55,476 INFO L226 Difference]: Without dead ends: 880 [2024-11-10 07:16:55,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 07:16:55,477 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 514 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:16:55,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 687 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:16:55,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-10 07:16:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 552. [2024-11-10 07:16:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 461 states have (on average 1.3253796095444685) internal successors, (611), 461 states have internal predecessors, (611), 78 states have call successors, (78), 12 states have call predecessors, (78), 12 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-10 07:16:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 767 transitions. [2024-11-10 07:16:55,507 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 767 transitions. Word has length 183 [2024-11-10 07:16:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:16:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 767 transitions. [2024-11-10 07:16:55,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.785714285714286) internal successors, (109), 14 states have internal predecessors, (109), 4 states have call successors, (72), 2 states have call predecessors, (72), 4 states have return successors, (73), 3 states have call predecessors, (73), 4 states have call successors, (73) [2024-11-10 07:16:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 767 transitions. [2024-11-10 07:16:55,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 07:16:55,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:16:55,509 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:16:55,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:16:55,709 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-10 07:16:55,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:16:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:16:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 2061593691, now seen corresponding path program 1 times [2024-11-10 07:16:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:16:55,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431637071] [2024-11-10 07:16:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:55,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:16:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:16:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165747408] [2024-11-10 07:16:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:16:55,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:16:55,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:16:55,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:16:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:16:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:16:56,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 07:16:56,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:16:56,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 338 proven. 12 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2024-11-10 07:16:56,499 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:17:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:17:25,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431637071] [2024-11-10 07:17:25,692 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:17:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165747408] [2024-11-10 07:17:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165747408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:17:25,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:17:25,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-10 07:17:25,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22499144] [2024-11-10 07:17:25,693 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:17:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:17:25,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:17:25,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:17:25,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=295, Unknown=7, NotChecked=0, Total=420 [2024-11-10 07:17:25,694 INFO L87 Difference]: Start difference. First operand 552 states and 767 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 07:17:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:28,553 INFO L93 Difference]: Finished difference Result 2054 states and 2777 transitions. [2024-11-10 07:17:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 07:17:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 184 [2024-11-10 07:17:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:28,563 INFO L225 Difference]: With dead ends: 2054 [2024-11-10 07:17:28,563 INFO L226 Difference]: Without dead ends: 1865 [2024-11-10 07:17:28,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=480, Invalid=1073, Unknown=7, NotChecked=0, Total=1560 [2024-11-10 07:17:28,565 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 473 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1147 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:28,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1147 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 07:17:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-10 07:17:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1314. [2024-11-10 07:17:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1131 states have (on average 1.3359858532272326) internal successors, (1511), 1132 states have internal predecessors, (1511), 152 states have call successors, (152), 30 states have call predecessors, (152), 30 states have return successors, (152), 151 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-10 07:17:28,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1815 transitions. [2024-11-10 07:17:28,623 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1815 transitions. Word has length 184 [2024-11-10 07:17:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:28,623 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1815 transitions. [2024-11-10 07:17:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (26), 3 states have call predecessors, (26), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-10 07:17:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1815 transitions. [2024-11-10 07:17:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-10 07:17:28,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:28,625 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:17:28,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 07:17:28,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:17:28,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:28,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:28,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1144758924, now seen corresponding path program 1 times [2024-11-10 07:17:28,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:17:28,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693950212] [2024-11-10 07:17:28,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:28,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:17:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:17:28,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586426971] [2024-11-10 07:17:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:28,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:17:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:17:28,964 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:17:28,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 07:17:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:17:29,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:17:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:17:29,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:17:29,258 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:17:29,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:17:29,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 07:17:29,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:17:29,465 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:17:29,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:17:29,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:17:29 BoogieIcfgContainer [2024-11-10 07:17:29,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:17:29,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:17:29,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:17:29,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:17:29,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:16:39" (3/4) ... [2024-11-10 07:17:29,574 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:17:29,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:17:29,576 INFO L158 Benchmark]: Toolchain (without parser) took 50949.59ms. Allocated memory was 155.2MB in the beginning and 539.0MB in the end (delta: 383.8MB). Free memory was 82.6MB in the beginning and 420.5MB in the end (delta: -337.9MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,576 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:17:29,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.35ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 82.4MB in the beginning and 179.9MB in the end (delta: -97.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,577 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.18ms. Allocated memory is still 213.9MB. Free memory was 179.9MB in the beginning and 172.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,577 INFO L158 Benchmark]: Boogie Preprocessor took 69.37ms. Allocated memory is still 213.9MB. Free memory was 172.6MB in the beginning and 162.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,577 INFO L158 Benchmark]: IcfgBuilder took 587.56ms. Allocated memory is still 213.9MB. Free memory was 162.1MB in the beginning and 122.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,577 INFO L158 Benchmark]: TraceAbstraction took 49884.33ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 122.2MB in the beginning and 421.6MB in the end (delta: -299.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,578 INFO L158 Benchmark]: Witness Printer took 3.41ms. Allocated memory is still 539.0MB. Free memory was 421.6MB in the beginning and 420.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 07:17:29,578 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.16ms. Allocated memory is still 155.2MB. Free memory is still 105.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.35ms. Allocated memory was 155.2MB in the beginning and 213.9MB in the end (delta: 58.7MB). Free memory was 82.4MB in the beginning and 179.9MB in the end (delta: -97.5MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.18ms. Allocated memory is still 213.9MB. Free memory was 179.9MB in the beginning and 172.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.37ms. Allocated memory is still 213.9MB. Free memory was 172.6MB in the beginning and 162.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 587.56ms. Allocated memory is still 213.9MB. Free memory was 162.1MB in the beginning and 122.2MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 49884.33ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 122.2MB in the beginning and 421.6MB in the end (delta: -299.3MB). Peak memory consumption was 24.7MB. Max. memory is 16.1GB. * Witness Printer took 3.41ms. Allocated memory is still 539.0MB. Free memory was 421.6MB in the beginning and 420.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of shiftRight at line 197. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 3511246143; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_5 = 1; [L26] unsigned char var_1_6 = 0; [L27] unsigned char var_1_7 = 5; [L28] unsigned long int var_1_8 = 2220610682; [L29] unsigned long int var_1_9 = 3786407275; [L30] unsigned char var_1_12 = 64; [L31] unsigned long int var_1_13 = 100; [L32] signed long int var_1_14 = 1; [L33] unsigned long int var_1_15 = 3489174775; [L34] signed char var_1_16 = 1; [L35] signed char var_1_17 = -16; [L36] signed short int var_1_18 = 0; [L37] signed short int var_1_19 = 64; [L38] signed short int var_1_20 = 2; [L39] double var_1_21 = 7.5; [L40] double var_1_22 = 99.5; [L41] signed short int var_1_23 = 500; [L42] unsigned short int var_1_24 = 5; [L43] double var_1_25 = 127.5; [L44] unsigned short int var_1_26 = 33797; [L45] unsigned short int var_1_28 = 27913; [L46] signed long int var_1_30 = 2; [L47] unsigned char last_1_var_1_7 = 5; [L48] signed short int last_1_var_1_18 = 0; [L49] unsigned short int last_1_var_1_24 = 5; [L50] signed long int last_1_var_1_30 = 2; VAL [isInitial=0, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=3511246143, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L201] isInitial = 1 [L202] FCALL initially() [L203] COND TRUE 1 [L204] CALL updateLastVariables() [L191] last_1_var_1_7 = var_1_7 [L192] last_1_var_1_18 = var_1_18 [L193] last_1_var_1_24 = var_1_24 [L194] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=3511246143, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L204] RET updateLastVariables() [L205] CALL updateVariables() [L149] var_1_2 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_2 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L150] RET assume_abort_if_not(var_1_2 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L151] CALL assume_abort_if_not(var_1_2 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L151] RET assume_abort_if_not(var_1_2 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L152] var_1_5 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L153] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L154] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L154] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L155] var_1_6 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L156] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L157] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L157] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=2220610682, var_1_9=3786407275] [L158] var_1_8 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_8 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L159] RET assume_abort_if_not(var_1_8 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L160] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L160] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=3786407275] [L161] var_1_9 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L162] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L163] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L163] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=64, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L164] var_1_12 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L165] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L166] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L166] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=1, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L167] var_1_14 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L168] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L169] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L169] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L170] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L170] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3489174775, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L171] var_1_15 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_15 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L172] RET assume_abort_if_not(var_1_15 >= 3221225470) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L173] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L173] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=-16, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L174] var_1_17 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_17 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L175] RET assume_abort_if_not(var_1_17 >= -127) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L176] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L176] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_21=15/2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L177] var_1_21 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L178] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_22=199/2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L179] var_1_22 = __VERIFIER_nondet_double() [L180] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L180] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_25=255/2, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L181] var_1_25 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L182] RET assume_abort_if_not((var_1_25 >= -922337.2036854776000e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=33797, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L183] var_1_26 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L184] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L185] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L185] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=27913, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L186] var_1_28 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_28 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L187] RET assume_abort_if_not(var_1_28 >= 16383) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L188] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L188] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L205] RET updateVariables() [L206] CALL step() [L54] unsigned long int stepLocal_5 = var_1_9; [L55] unsigned long int stepLocal_4 = (((0u) < (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))) ? (0u) : (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))); VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_5=-2147483649, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=500, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L56] COND FALSE !(last_1_var_1_30 >= stepLocal_5) [L67] var_1_23 = var_1_12 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L69] signed long int stepLocal_6 = -1; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=5, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L70] COND TRUE var_1_22 <= ((((var_1_21) < (var_1_25)) ? (var_1_21) : (var_1_25))) [L71] var_1_24 = (((((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) > (last_1_var_1_7)) ? ((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) : (last_1_var_1_7))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L77] EXPR last_1_var_1_7 >> var_1_2 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=5, var_1_8=4294934530, var_1_9=-2147483649] [L77] COND TRUE (last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24)))) [L78] var_1_7 = var_1_12 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L82] COND FALSE !(((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) >= (- 9.5)) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=64, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L85] var_1_1 = (var_1_2 - 8u) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L86] EXPR var_1_12 ^ var_1_7 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L86] signed long int stepLocal_1 = var_1_12 ^ var_1_7; [L87] signed long int stepLocal_0 = var_1_24 % var_1_14; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_0=0, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=100, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L88] COND FALSE !(stepLocal_0 > 16u) [L93] var_1_13 = ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L95] COND TRUE var_1_12 >= var_1_7 [L96] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L98] unsigned char stepLocal_9 = var_1_6; [L99] unsigned short int stepLocal_8 = var_1_24; [L100] signed char stepLocal_7 = var_1_16; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_7=1, stepLocal_8=32767, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L101] COND TRUE (last_1_var_1_30 / var_1_26) != stepLocal_8 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_7=1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=2, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L102] COND TRUE var_1_23 <= stepLocal_7 [L103] var_1_30 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L116] COND FALSE !(((- var_1_2) + var_1_7) != var_1_24) [L123] var_1_3 = var_1_6 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L125] unsigned long int stepLocal_2 = var_1_2; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_2=-32767, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L126] COND TRUE var_1_8 > stepLocal_2 [L127] var_1_18 = (((((-32) > (var_1_12)) ? (-32) : (var_1_12))) + ((((var_1_20) < (last_1_var_1_18)) ? (var_1_20) : (last_1_var_1_18)))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L135] unsigned char stepLocal_3 = var_1_12; VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_3=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L136] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_3=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L139] COND TRUE stepLocal_3 < 100 [L140] var_1_19 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, stepLocal_1=0, stepLocal_4=0, stepLocal_6=-1, stepLocal_9=0, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L206] RET step() [L207] CALL, EXPR property() [L197] EXPR ((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR last_1_var_1_7 >> var_1_2 VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR ((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR (((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR ((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197] EXPR (((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7)))))) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L197-L198] return ((((((((((var_1_1 == ((unsigned long int) (var_1_2 - 8u))) && ((((- var_1_2) + var_1_7) != var_1_24) ? ((var_1_2 >= var_1_24) ? (var_1_3 == ((unsigned char) 1)) : (var_1_3 == ((unsigned char) var_1_5))) : (var_1_3 == ((unsigned char) var_1_6)))) && (((last_1_var_1_7 >> var_1_2) >= (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - ((((last_1_var_1_24) < (last_1_var_1_24)) ? (last_1_var_1_24) : (last_1_var_1_24))))) ? (var_1_7 == ((unsigned char) var_1_12)) : (var_1_7 == ((unsigned char) var_1_12)))) && (((var_1_24 % var_1_14) > 16u) ? ((var_1_14 < (var_1_12 ^ var_1_7)) ? (var_1_13 == ((unsigned long int) ((((((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) > (((var_1_15 - var_1_23) - var_1_24))) ? (((((var_1_7) > (var_1_2)) ? (var_1_7) : (var_1_2)))) : (((var_1_15 - var_1_23) - var_1_24)))))) : 1) : (var_1_13 == ((unsigned long int) ((((var_1_24) < (var_1_7)) ? (var_1_24) : (var_1_7))))))) && ((var_1_12 >= var_1_7) ? (var_1_16 == ((signed char) var_1_17)) : 1)) && ((var_1_8 > var_1_2) ? (var_1_18 == ((signed short int) (((((-32) > (var_1_12)) ? (-32) : (var_1_12))) + ((((var_1_20) < (last_1_var_1_18)) ? (var_1_20) : (last_1_var_1_18)))))) : (var_1_3 ? (var_1_18 == ((signed short int) var_1_12)) : (var_1_18 == ((signed short int) var_1_20))))) && (var_1_3 ? (var_1_19 == ((signed short int) var_1_17)) : ((var_1_12 < 100) ? (var_1_19 == ((signed short int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_5 ? (var_1_19 == ((signed short int) var_1_13)) : 1)))) && ((((((var_1_21) < (var_1_22)) ? (var_1_21) : (var_1_22))) >= (- 9.5)) ? (var_1_20 == ((signed short int) var_1_7)) : 1)) && ((last_1_var_1_30 >= var_1_9) ? (((last_1_var_1_30 / var_1_8) > ((((0u) < (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))) ? (0u) : (((((last_1_var_1_7) > (last_1_var_1_24)) ? (last_1_var_1_7) : (last_1_var_1_24))))))) ? (var_1_6 ? (var_1_23 == ((signed short int) var_1_12)) : (var_1_23 == ((signed short int) last_1_var_1_24))) : (var_1_23 == ((signed short int) var_1_17))) : (var_1_23 == ((signed short int) var_1_12)))) && ((var_1_22 <= ((((var_1_21) < (var_1_25)) ? (var_1_21) : (var_1_25)))) ? (var_1_24 == ((unsigned short int) (((((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) > (last_1_var_1_7)) ? ((var_1_26 - ((((last_1_var_1_24) < (var_1_12)) ? (last_1_var_1_24) : (var_1_12))))) : (last_1_var_1_7))))) : (((last_1_var_1_24 + (last_1_var_1_18 / 16)) < -1) ? (var_1_24 == ((unsigned short int) (((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (last_1_var_1_24)) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (last_1_var_1_24))) + (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - (last_1_var_1_7 + 2))))) : 1))) && (((last_1_var_1_30 / var_1_26) != var_1_24) ? ((var_1_23 <= var_1_16) ? (var_1_30 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))) : (((var_1_25 != (- 50.7)) && var_1_6) ? (var_1_6 ? (var_1_30 == ((signed long int) var_1_15)) : 1) : (var_1_30 == ((signed long int) var_1_7)))) : (var_1_30 == ((signed long int) var_1_7))) ; [L207] RET, EXPR property() [L207] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=0, last_1_var_1_24=5, last_1_var_1_30=2, last_1_var_1_7=5, var_1_12=0, var_1_13=0, var_1_14=-32767, var_1_15=3221225470, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=-32775, var_1_20=2, var_1_23=0, var_1_24=32767, var_1_26=32767, var_1_28=16383, var_1_2=-32767, var_1_30=16383, var_1_3=0, var_1_5=1, var_1_6=0, var_1_7=0, var_1_8=4294934530, var_1_9=-2147483649] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.7s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3102 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3098 mSDsluCounter, 6617 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4601 mSDsCounter, 710 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3749 IncrementalHoareTripleChecker+Invalid, 4459 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 710 mSolverCounterUnsat, 2016 mSDtfsCounter, 3749 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1761 GetRequests, 1629 SyntacticMatches, 4 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 31.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1314occurred in iteration=13, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1724 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 38.4s InterpolantComputationTime, 3256 NumberOfCodeBlocks, 3256 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3050 ConstructedInterpolants, 0 QuantifiedInterpolants, 10973 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1288 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 21668/22100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:17:29,796 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 07:17:29,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_loopvsstraightlinecode_100-while_file-61.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 0bef9603856cb87254a0fac59ed35f7753088518d4df6d817dae75a7c6158cf8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:17:31,519 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:17:31,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:17:31,587 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:17:31,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:17:31,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:17:31,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:17:31,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:17:31,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:17:31,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:17:31,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:17:31,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:17:31,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:17:31,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:17:31,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:17:31,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:17:31,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:17:31,624 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:17:31,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:17:31,625 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:17:31,625 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:17:31,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:17:31,626 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:17:31,626 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:17:31,627 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:17:31,628 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:17:31,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:17:31,628 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:17:31,628 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:17:31,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:17:31,629 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:17:31,629 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:17:31,629 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:17:31,629 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:17:31,629 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:17:31,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:17:31,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:17:31,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:17:31,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:17:31,630 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 -> 0bef9603856cb87254a0fac59ed35f7753088518d4df6d817dae75a7c6158cf8 [2024-11-10 07:17:31,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:17:31,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:17:31,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:17:31,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:17:31,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:17:31,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:17:33,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:17:33,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:17:33,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:17:33,490 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f1c8d1d/e988c5fb413a41a7b16e3da2e0018eaa/FLAG22743c6be [2024-11-10 07:17:33,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39f1c8d1d/e988c5fb413a41a7b16e3da2e0018eaa [2024-11-10 07:17:33,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:17:33,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:17:33,511 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:17:33,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:17:33,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:17:33,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fda27bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33, skipping insertion in model container [2024-11-10 07:17:33,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,549 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:17:33,708 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_loopvsstraightlinecode_100-while_file-61.i[916,929] [2024-11-10 07:17:33,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:17:33,807 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:17:33,818 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_loopvsstraightlinecode_100-while_file-61.i[916,929] [2024-11-10 07:17:33,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:17:33,877 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:17:33,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33 WrapperNode [2024-11-10 07:17:33,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:17:33,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:17:33,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:17:33,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:17:33,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,929 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-10 07:17:33,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:17:33,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:17:33,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:17:33,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:17:33,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,964 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:17:33,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,972 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:17:33,984 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:17:33,984 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:17:33,984 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:17:33,984 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (1/1) ... [2024-11-10 07:17:33,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:17:34,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:17:34,022 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:17:34,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:17:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:17:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:17:34,056 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:17:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:17:34,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:17:34,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:17:34,131 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:17:34,133 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:17:34,745 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-10 07:17:34,745 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:17:34,763 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:17:34,763 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:17:34,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:17:34 BoogieIcfgContainer [2024-11-10 07:17:34,764 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:17:34,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:17:34,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:17:34,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:17:34,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:17:33" (1/3) ... [2024-11-10 07:17:34,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c6d0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:34, skipping insertion in model container [2024-11-10 07:17:34,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:17:33" (2/3) ... [2024-11-10 07:17:34,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c6d0b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:17:34, skipping insertion in model container [2024-11-10 07:17:34,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:17:34" (3/3) ... [2024-11-10 07:17:34,770 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-61.i [2024-11-10 07:17:34,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:17:34,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:17:34,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:17:34,849 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;@3d77c4b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:17:34,849 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:17:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:17:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 07:17:34,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:34,866 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:17:34,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:34,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1029183383, now seen corresponding path program 1 times [2024-11-10 07:17:34,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:17:34,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472630698] [2024-11-10 07:17:34,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:34,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:17:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:17:34,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:17:34,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:17:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:35,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:17:35,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:17:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-10 07:17:35,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:17:35,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:17:35,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472630698] [2024-11-10 07:17:35,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472630698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:17:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:17:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:17:35,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070829490] [2024-11-10 07:17:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:17:35,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:17:35,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:17:35,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:17:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:17:35,256 INFO L87 Difference]: Start difference. First operand has 88 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 60 states have internal predecessors, (85), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:17:35,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:35,278 INFO L93 Difference]: Finished difference Result 168 states and 293 transitions. [2024-11-10 07:17:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:17:35,280 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-10 07:17:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:35,285 INFO L225 Difference]: With dead ends: 168 [2024-11-10 07:17:35,286 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 07:17:35,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:17:35,290 INFO L432 NwaCegarLoop]: 129 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, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:35,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:17:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 07:17:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 07:17:35,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.4) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:17:35,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-11-10 07:17:35,334 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 170 [2024-11-10 07:17:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:35,334 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-11-10 07:17:35,334 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:17:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-11-10 07:17:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-10 07:17:35,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:35,339 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:17:35,350 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-10 07:17:35,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:17:35,540 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:35,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:35,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1550949875, now seen corresponding path program 1 times [2024-11-10 07:17:35,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:17:35,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963849222] [2024-11-10 07:17:35,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:35,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:17:35,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:17:35,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:17:35,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:17:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:35,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:17:35,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:17:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 435 proven. 60 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 07:17:36,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:17:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 15 proven. 60 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 07:17:36,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:17:36,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963849222] [2024-11-10 07:17:36,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963849222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:17:36,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:17:36,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-10 07:17:36,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50557031] [2024-11-10 07:17:36,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:17:36,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:17:36,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:17:36,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:17:36,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:17:36,431 INFO L87 Difference]: Start difference. First operand 83 states and 129 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 07:17:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:17:37,094 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2024-11-10 07:17:37,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 07:17:37,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 170 [2024-11-10 07:17:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:17:37,097 INFO L225 Difference]: With dead ends: 257 [2024-11-10 07:17:37,097 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 07:17:37,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:17:37,099 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:17:37,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 307 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:17:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 07:17:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 92. [2024-11-10 07:17:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 07:17:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-10 07:17:37,115 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 170 [2024-11-10 07:17:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:17:37,116 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-10 07:17:37,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2024-11-10 07:17:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-10 07:17:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-10 07:17:37,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:17:37,122 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:17:37,133 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-10 07:17:37,322 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-10 07:17:37,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:17:37,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:17:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522903, now seen corresponding path program 1 times [2024-11-10 07:17:37,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:17:37,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146814271] [2024-11-10 07:17:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:37,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:17:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:17:37,326 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-10 07:17:37,327 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-10 07:17:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:37,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 07:17:37,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:17:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 584 proven. 105 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-10 07:17:38,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:17:38,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:17:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146814271] [2024-11-10 07:17:38,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146814271] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:17:38,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1146295418] [2024-11-10 07:17:38,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:17:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 07:17:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 07:17:38,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 07:17:38,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 07:17:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:17:39,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 07:17:39,208 INFO L278 TraceCheckSpWp]: Computing forward predicates...