./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:07:35,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:07:35,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:07:35,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:07:35,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:07:35,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:07:35,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:07:35,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:07:35,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:07:35,542 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:07:35,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:07:35,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:07:35,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:07:35,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:07:35,546 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:07:35,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:07:35,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:07:35,547 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:07:35,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:07:35,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:07:35,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:07:35,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:07:35,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:07:35,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:07:35,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:07:35,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:07:35,550 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:07:35,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:07:35,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:07:35,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:07:35,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:07:35,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:07:35,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:35,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:07:35,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:07:35,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:07:35,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:07:35,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:07:35,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:07:35,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:07:35,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:07:35,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:07:35,554 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2024-11-16 17:07:35,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:07:35,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:07:35,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:07:35,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:07:35,864 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:07:35,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-16 17:07:37,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:07:37,571 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:07:37,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-16 17:07:37,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e715fca0b/924ccef4256e4669a51826e3c74e77a2/FLAG8c7288708 [2024-11-16 17:07:37,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e715fca0b/924ccef4256e4669a51826e3c74e77a2 [2024-11-16 17:07:37,612 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:07:37,613 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:07:37,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:37,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:07:37,622 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:07:37,623 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:37" (1/1) ... [2024-11-16 17:07:37,624 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d853d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:37, skipping insertion in model container [2024-11-16 17:07:37,624 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:07:37" (1/1) ... [2024-11-16 17:07:37,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:07:37,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-11-16 17:07:37,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:37,996 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:07:38,009 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-11-16 17:07:38,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:07:38,078 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:07:38,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38 WrapperNode [2024-11-16 17:07:38,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:07:38,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:38,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:07:38,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:07:38,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,160 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-11-16 17:07:38,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:07:38,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:07:38,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:07:38,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:07:38,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:07:38,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:07:38,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:07:38,268 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:07:38,268 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:07:38,269 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (1/1) ... [2024-11-16 17:07:38,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:07:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:38,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:07:38,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:07:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:07:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:07:38,355 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:07:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:07:38,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:07:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:07:38,456 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:07:38,458 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:07:39,066 INFO L1250 $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-16 17:07:39,120 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2024-11-16 17:07:39,120 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:07:39,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:07:39,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:07:39,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:39 BoogieIcfgContainer [2024-11-16 17:07:39,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:07:39,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:07:39,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:07:39,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:07:39,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:07:37" (1/3) ... [2024-11-16 17:07:39,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a54c9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:39, skipping insertion in model container [2024-11-16 17:07:39,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:07:38" (2/3) ... [2024-11-16 17:07:39,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a54c9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:07:39, skipping insertion in model container [2024-11-16 17:07:39,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:39" (3/3) ... [2024-11-16 17:07:39,161 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2024-11-16 17:07:39,178 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:07:39,179 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:07:39,240 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:07:39,249 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;@4a096aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:07:39,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:07:39,254 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-16 17:07:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 17:07:39,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:39,268 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-16 17:07:39,269 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:39,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:39,274 INFO L85 PathProgramCache]: Analyzing trace with hash 708793512, now seen corresponding path program 1 times [2024-11-16 17:07:39,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:39,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188313076] [2024-11-16 17:07:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:39,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:39,821 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-16 17:07:39,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:39,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188313076] [2024-11-16 17:07:39,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188313076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:39,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:07:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221583330] [2024-11-16 17:07:39,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:39,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:07:39,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:39,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:07:39,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:07:39,867 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-16 17:07:39,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:39,926 INFO L93 Difference]: Finished difference Result 210 states and 357 transitions. [2024-11-16 17:07:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:07:39,929 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-16 17:07:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:39,940 INFO L225 Difference]: With dead ends: 210 [2024-11-16 17:07:39,940 INFO L226 Difference]: Without dead ends: 104 [2024-11-16 17:07:39,945 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-16 17:07:39,949 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-16 17:07:39,950 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-16 17:07:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-16 17:07:39,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-16 17:07:39,990 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-16 17:07:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2024-11-16 17:07:39,995 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 177 [2024-11-16 17:07:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:39,995 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2024-11-16 17:07:39,996 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-16 17:07:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2024-11-16 17:07:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 17:07:40,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:40,001 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-16 17:07:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:07:40,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1083232564, now seen corresponding path program 1 times [2024-11-16 17:07:40,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:40,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012716942] [2024-11-16 17:07:40,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:40,883 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-16 17:07:40,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:40,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012716942] [2024-11-16 17:07:40,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012716942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:40,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:40,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:07:40,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962919077] [2024-11-16 17:07:40,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:40,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:07:40,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:40,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:07:40,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:07:40,891 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-16 17:07:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:41,016 INFO L93 Difference]: Finished difference Result 209 states and 322 transitions. [2024-11-16 17:07:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:07:41,019 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-16 17:07:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:41,024 INFO L225 Difference]: With dead ends: 209 [2024-11-16 17:07:41,025 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 17:07:41,026 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-16 17:07:41,028 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-16 17:07:41,029 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-16 17:07:41,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 17:07:41,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-16 17:07:41,050 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-16 17:07:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 163 transitions. [2024-11-16 17:07:41,055 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 163 transitions. Word has length 177 [2024-11-16 17:07:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:41,055 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 163 transitions. [2024-11-16 17:07:41,056 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-16 17:07:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 163 transitions. [2024-11-16 17:07:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-16 17:07:41,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:41,060 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-16 17:07:41,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:07:41,061 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:41,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:41,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1858425035, now seen corresponding path program 1 times [2024-11-16 17:07:41,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:41,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50020536] [2024-11-16 17:07:41,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:41,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:44,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:44,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:44,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:44,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:44,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:44,298 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-16 17:07:44,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:44,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50020536] [2024-11-16 17:07:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50020536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:44,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 17:07:44,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707672656] [2024-11-16 17:07:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:44,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 17:07:44,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:44,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 17:07:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:07:44,304 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-16 17:07:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:46,587 INFO L93 Difference]: Finished difference Result 472 states and 711 transitions. [2024-11-16 17:07:46,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 17:07:46,588 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-16 17:07:46,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:46,592 INFO L225 Difference]: With dead ends: 472 [2024-11-16 17:07:46,594 INFO L226 Difference]: Without dead ends: 367 [2024-11-16 17:07:46,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-16 17:07:46,598 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 858 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s 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.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:46,598 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.5s Time] [2024-11-16 17:07:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-16 17:07:46,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 205. [2024-11-16 17:07:46,638 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-16 17:07:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 315 transitions. [2024-11-16 17:07:46,642 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 315 transitions. Word has length 177 [2024-11-16 17:07:46,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:46,644 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 315 transitions. [2024-11-16 17:07:46,644 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-16 17:07:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 315 transitions. [2024-11-16 17:07:46,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 17:07:46,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:46,651 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-16 17:07:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:07:46,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1933645649, now seen corresponding path program 1 times [2024-11-16 17:07:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856160723] [2024-11-16 17:07:46,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:48,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:48,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:48,633 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-16 17:07:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:48,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856160723] [2024-11-16 17:07:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856160723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:48,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:07:48,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892288606] [2024-11-16 17:07:48,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:48,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:07:48,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:07:48,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:07:48,636 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-16 17:07:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:49,078 INFO L93 Difference]: Finished difference Result 392 states and 593 transitions. [2024-11-16 17:07:49,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:07:49,081 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-16 17:07:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:49,083 INFO L225 Difference]: With dead ends: 392 [2024-11-16 17:07:49,083 INFO L226 Difference]: Without dead ends: 287 [2024-11-16 17:07:49,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:07:49,089 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 151 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:49,092 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.4s Time] [2024-11-16 17:07:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-16 17:07:49,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 223. [2024-11-16 17:07:49,129 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-16 17:07:49,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2024-11-16 17:07:49,134 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 178 [2024-11-16 17:07:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:49,135 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2024-11-16 17:07:49,135 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-16 17:07:49,136 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2024-11-16 17:07:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 17:07:49,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:49,142 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-16 17:07:49,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:07:49,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:49,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:49,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1292168775, now seen corresponding path program 1 times [2024-11-16 17:07:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:49,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101261833] [2024-11-16 17:07:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:49,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:49,836 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-16 17:07:49,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:49,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101261833] [2024-11-16 17:07:49,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101261833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:49,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:49,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:07:49,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625110666] [2024-11-16 17:07:49,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:49,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:07:49,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:49,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:07:49,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:07:49,839 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-16 17:07:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:50,589 INFO L93 Difference]: Finished difference Result 723 states and 1109 transitions. [2024-11-16 17:07:50,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:07:50,590 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-16 17:07:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:50,594 INFO L225 Difference]: With dead ends: 723 [2024-11-16 17:07:50,594 INFO L226 Difference]: Without dead ends: 579 [2024-11-16 17:07:50,595 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-16 17:07:50,596 INFO L432 NwaCegarLoop]: 286 mSDtfsCounter, 249 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:50,597 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.6s Time] [2024-11-16 17:07:50,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-16 17:07:50,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 521. [2024-11-16 17:07:50,641 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-16 17:07:50,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-16 17:07:50,645 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-16 17:07:50,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:50,646 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-16 17:07:50,647 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-16 17:07:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-16 17:07:50,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-16 17:07:50,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:50,649 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-16 17:07:50,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:07:50,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:50,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:50,650 INFO L85 PathProgramCache]: Analyzing trace with hash -863937951, now seen corresponding path program 1 times [2024-11-16 17:07:50,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:50,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89338916] [2024-11-16 17:07:50,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:50,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:52,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:52,235 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-16 17:07:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89338916] [2024-11-16 17:07:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89338916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:07:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275011373] [2024-11-16 17:07:52,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:52,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:07:52,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:52,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:07:52,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:07:52,238 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-16 17:07:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:52,631 INFO L93 Difference]: Finished difference Result 992 states and 1537 transitions. [2024-11-16 17:07:52,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:07:52,632 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-16 17:07:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:52,636 INFO L225 Difference]: With dead ends: 992 [2024-11-16 17:07:52,636 INFO L226 Difference]: Without dead ends: 649 [2024-11-16 17:07:52,637 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-16 17:07:52,638 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 98 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:52,638 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.3s Time] [2024-11-16 17:07:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2024-11-16 17:07:52,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 521. [2024-11-16 17:07:52,681 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-16 17:07:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 811 transitions. [2024-11-16 17:07:52,685 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 811 transitions. Word has length 178 [2024-11-16 17:07:52,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:52,685 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 811 transitions. [2024-11-16 17:07:52,686 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-16 17:07:52,686 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 811 transitions. [2024-11-16 17:07:52,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-16 17:07:52,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:52,688 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-16 17:07:52,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 17:07:52,689 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:52,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash -349669668, now seen corresponding path program 1 times [2024-11-16 17:07:52,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:52,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579144312] [2024-11-16 17:07:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:52,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:53,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:53,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:53,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:53,838 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-16 17:07:53,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:53,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579144312] [2024-11-16 17:07:53,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579144312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:53,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:53,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:07:53,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816452486] [2024-11-16 17:07:53,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:53,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:07:53,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:53,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:07:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:07:53,841 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-16 17:07:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:54,239 INFO L93 Difference]: Finished difference Result 1057 states and 1611 transitions. [2024-11-16 17:07:54,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:07:54,240 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-16 17:07:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:54,249 INFO L225 Difference]: With dead ends: 1057 [2024-11-16 17:07:54,249 INFO L226 Difference]: Without dead ends: 700 [2024-11-16 17:07:54,251 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-16 17:07:54,251 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 135 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:54,253 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.3s Time] [2024-11-16 17:07:54,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-16 17:07:54,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 493. [2024-11-16 17:07:54,303 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-16 17:07:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 748 transitions. [2024-11-16 17:07:54,306 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 748 transitions. Word has length 179 [2024-11-16 17:07:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:54,306 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 748 transitions. [2024-11-16 17:07:54,307 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-16 17:07:54,307 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 748 transitions. [2024-11-16 17:07:54,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-16 17:07:54,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:54,309 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-16 17:07:54,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 17:07:54,310 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:54,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:54,310 INFO L85 PathProgramCache]: Analyzing trace with hash -501087181, now seen corresponding path program 1 times [2024-11-16 17:07:54,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:54,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896650345] [2024-11-16 17:07:54,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:54,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:54,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:54,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:54,682 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-16 17:07:54,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896650345] [2024-11-16 17:07:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896650345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:54,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:07:54,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704800272] [2024-11-16 17:07:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:07:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:07:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:07:54,686 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-16 17:07:54,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:54,888 INFO L93 Difference]: Finished difference Result 863 states and 1312 transitions. [2024-11-16 17:07:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:07:54,889 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-16 17:07:54,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:54,892 INFO L225 Difference]: With dead ends: 863 [2024-11-16 17:07:54,892 INFO L226 Difference]: Without dead ends: 486 [2024-11-16 17:07:54,893 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-16 17:07:54,895 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:54,896 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.2s Time] [2024-11-16 17:07:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-16 17:07:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2024-11-16 17:07:54,939 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-16 17:07:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 729 transitions. [2024-11-16 17:07:54,942 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 729 transitions. Word has length 180 [2024-11-16 17:07:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:54,943 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 729 transitions. [2024-11-16 17:07:54,944 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-16 17:07:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 729 transitions. [2024-11-16 17:07:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:07:54,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:54,948 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-16 17:07:54,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 17:07:54,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:54,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:54,949 INFO L85 PathProgramCache]: Analyzing trace with hash -959422466, now seen corresponding path program 1 times [2024-11-16 17:07:54,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:54,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422682539] [2024-11-16 17:07:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,471 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-16 17:07:55,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:55,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422682539] [2024-11-16 17:07:55,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422682539] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:07:55,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991817270] [2024-11-16 17:07:55,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:55,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:07:55,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:55,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:07:55,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:07:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:55,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:07:55,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:56,044 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-16 17:07:56,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:07:56,337 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-16 17:07:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991817270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:07:56,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:07:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-11-16 17:07:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709871064] [2024-11-16 17:07:56,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:07:56,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:07:56,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:56,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:07:56,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:07:56,341 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-16 17:07:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:56,567 INFO L93 Difference]: Finished difference Result 848 states and 1254 transitions. [2024-11-16 17:07:56,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:07:56,569 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-16 17:07:56,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:56,572 INFO L225 Difference]: With dead ends: 848 [2024-11-16 17:07:56,572 INFO L226 Difference]: Without dead ends: 468 [2024-11-16 17:07:56,573 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-16 17:07:56,574 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:56,574 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.2s Time] [2024-11-16 17:07:56,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-16 17:07:56,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 456. [2024-11-16 17:07:56,608 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-16 17:07:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 665 transitions. [2024-11-16 17:07:56,611 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 665 transitions. Word has length 182 [2024-11-16 17:07:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:56,611 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 665 transitions. [2024-11-16 17:07:56,612 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-16 17:07:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 665 transitions. [2024-11-16 17:07:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:07:56,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:56,615 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-16 17:07:56,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:07:56,816 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-16 17:07:56,817 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:56,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash 823696142, now seen corresponding path program 1 times [2024-11-16 17:07:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642700354] [2024-11-16 17:07:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:56,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:56,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:56,986 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-16 17:07:56,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:56,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642700354] [2024-11-16 17:07:56,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642700354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:07:56,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982789081] [2024-11-16 17:07:56,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:07:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:07:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:07:56,989 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-16 17:07:57,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:57,085 INFO L93 Difference]: Finished difference Result 979 states and 1427 transitions. [2024-11-16 17:07:57,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:07:57,087 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-16 17:07:57,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:57,090 INFO L225 Difference]: With dead ends: 979 [2024-11-16 17:07:57,091 INFO L226 Difference]: Without dead ends: 653 [2024-11-16 17:07:57,092 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-16 17:07:57,093 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:57,093 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.1s Time] [2024-11-16 17:07:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-16 17:07:57,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 604. [2024-11-16 17:07:57,130 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-16 17:07:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 888 transitions. [2024-11-16 17:07:57,133 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 888 transitions. Word has length 182 [2024-11-16 17:07:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:57,134 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 888 transitions. [2024-11-16 17:07:57,134 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-16 17:07:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 888 transitions. [2024-11-16 17:07:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 17:07:57,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:57,137 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-16 17:07:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 17:07:57,137 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1038031961, now seen corresponding path program 1 times [2024-11-16 17:07:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781508949] [2024-11-16 17:07:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:57,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:57,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:57,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:57,419 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-16 17:07:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:57,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781508949] [2024-11-16 17:07:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781508949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:07:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:07:57,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:07:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422472627] [2024-11-16 17:07:57,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:07:57,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:07:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:07:57,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:07:57,421 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-16 17:07:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:07:57,656 INFO L93 Difference]: Finished difference Result 1044 states and 1524 transitions. [2024-11-16 17:07:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:07:57,657 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-16 17:07:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:07:57,661 INFO L225 Difference]: With dead ends: 1044 [2024-11-16 17:07:57,662 INFO L226 Difference]: Without dead ends: 769 [2024-11-16 17:07:57,663 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-16 17:07:57,663 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.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:07:57,664 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.2s Time] [2024-11-16 17:07:57,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-16 17:07:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 604. [2024-11-16 17:07:57,703 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-16 17:07:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 887 transitions. [2024-11-16 17:07:57,706 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 887 transitions. Word has length 182 [2024-11-16 17:07:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:07:57,707 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 887 transitions. [2024-11-16 17:07:57,707 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-16 17:07:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 887 transitions. [2024-11-16 17:07:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 17:07:57,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:07:57,709 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-16 17:07:57,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 17:07:57,709 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:07:57,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:07:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1948549355, now seen corresponding path program 1 times [2024-11-16 17:07:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:07:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551120673] [2024-11-16 17:07:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:57,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:07:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:07:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:07:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:07:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:07:58,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:07:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:07:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:07:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:07:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:07:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:07:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:07:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:07:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:07:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 17:07:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 17:07:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 17:07:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 17:07:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 17:07:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 17:07:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 17:07:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:07:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:07:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 17:07:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:07:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 17:07:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:07:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,245 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-16 17:07:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:07:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551120673] [2024-11-16 17:07:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551120673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:07:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550171264] [2024-11-16 17:07:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:07:58,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:07:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:07:58,249 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:07:58,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 17:07:58,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:07:58,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 17:07:58,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:07:58,962 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-16 17:07:58,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:07:59,531 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-16 17:07:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550171264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:07:59,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:07:59,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 14 [2024-11-16 17:07:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883089264] [2024-11-16 17:07:59,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:07:59,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 17:07:59,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:07:59,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 17:07:59,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-16 17:07:59,534 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-16 17:08:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:08:00,816 INFO L93 Difference]: Finished difference Result 1479 states and 2087 transitions. [2024-11-16 17:08:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-16 17:08:00,817 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-16 17:08:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:08:00,822 INFO L225 Difference]: With dead ends: 1479 [2024-11-16 17:08:00,822 INFO L226 Difference]: Without dead ends: 880 [2024-11-16 17:08:00,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 412 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=263, Invalid=927, Unknown=0, NotChecked=0, Total=1190 [2024-11-16 17:08:00,827 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 514 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2024-11-16 17:08:00,827 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.8s Time] [2024-11-16 17:08:00,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-16 17:08:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 552. [2024-11-16 17:08:00,880 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-16 17:08:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 767 transitions. [2024-11-16 17:08:00,885 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 767 transitions. Word has length 183 [2024-11-16 17:08:00,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:08:00,886 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 767 transitions. [2024-11-16 17:08:00,886 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-16 17:08:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 767 transitions. [2024-11-16 17:08:00,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 17:08:00,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:00,889 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-16 17:08:00,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 17:08:01,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-16 17:08:01,090 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:01,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:01,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2061593691, now seen corresponding path program 1 times [2024-11-16 17:08:01,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:08:01,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194920607] [2024-11-16 17:08:01,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:01,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:08:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:08:01,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704655138] [2024-11-16 17:08:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:08:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:08:01,307 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-16 17:08:01,308 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-16 17:08:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:01,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 17:08:01,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:02,201 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-16 17:08:02,201 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:08:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:08:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194920607] [2024-11-16 17:08:31,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:08:31,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704655138] [2024-11-16 17:08:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704655138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:08:31,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:08:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-16 17:08:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441050098] [2024-11-16 17:08:31,518 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 17:08:31,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 17:08:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:08:31,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 17:08:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=295, Unknown=7, NotChecked=0, Total=420 [2024-11-16 17:08:31,520 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-16 17:08:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:08:34,708 INFO L93 Difference]: Finished difference Result 2054 states and 2777 transitions. [2024-11-16 17:08:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-16 17:08:34,709 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-16 17:08:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:08:34,718 INFO L225 Difference]: With dead ends: 2054 [2024-11-16 17:08:34,718 INFO L226 Difference]: Without dead ends: 1865 [2024-11-16 17:08:34,720 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-16 17:08:34,722 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 473 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:08:34,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1147 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 17:08:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-16 17:08:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1314. [2024-11-16 17:08:34,800 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-16 17:08:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1815 transitions. [2024-11-16 17:08:34,805 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1815 transitions. Word has length 184 [2024-11-16 17:08:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:08:34,806 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1815 transitions. [2024-11-16 17:08:34,806 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-16 17:08:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1815 transitions. [2024-11-16 17:08:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 17:08:34,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:34,808 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-16 17:08:34,827 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-16 17:08:35,010 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-16 17:08:35,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:35,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:35,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1144758924, now seen corresponding path program 1 times [2024-11-16 17:08:35,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:08:35,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452266956] [2024-11-16 17:08:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:35,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:08:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:08:35,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051173122] [2024-11-16 17:08:35,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:08:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:08:35,225 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-16 17:08:35,226 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-16 17:08:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:08:35,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:08:35,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:08:35,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:08:35,595 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:08:35,597 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:08:35,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 17:08:35,802 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-16 17:08:35,805 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:08:35,925 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:08:35,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:08:35 BoogieIcfgContainer [2024-11-16 17:08:35,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:08:35,929 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:08:35,929 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:08:35,929 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:08:35,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:07:39" (3/4) ... [2024-11-16 17:08:35,932 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:08:35,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:08:35,933 INFO L158 Benchmark]: Toolchain (without parser) took 58320.49ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 99.5MB in the beginning and 351.4MB in the end (delta: -252.0MB). Peak memory consumption was 79.8MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,933 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:08:35,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.41ms. Allocated memory is still 163.6MB. Free memory was 99.0MB in the beginning and 124.8MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.32ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 117.3MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,934 INFO L158 Benchmark]: Boogie Preprocessor took 105.09ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 106.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,934 INFO L158 Benchmark]: IcfgBuilder took 881.94ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 68.2MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,935 INFO L158 Benchmark]: TraceAbstraction took 56775.38ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 66.9MB in the beginning and 351.4MB in the end (delta: -284.5MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2024-11-16 17:08:35,935 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 497.0MB. Free memory is still 351.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:08:35,936 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.13ms. Allocated memory is still 96.5MB. Free memory was 50.7MB in the beginning and 50.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 462.41ms. Allocated memory is still 163.6MB. Free memory was 99.0MB in the beginning and 124.8MB in the end (delta: -25.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.32ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 117.3MB in the end (delta: 7.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.09ms. Allocated memory is still 163.6MB. Free memory was 117.3MB in the beginning and 106.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 881.94ms. Allocated memory is still 163.6MB. Free memory was 106.8MB in the beginning and 68.2MB in the end (delta: 38.6MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 56775.38ms. Allocated memory was 163.6MB in the beginning and 497.0MB in the end (delta: 333.4MB). Free memory was 66.9MB in the beginning and 351.4MB in the end (delta: -284.5MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 497.0MB. Free memory is still 351.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 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: 56.6s, OverallIterations: 14, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3102 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3098 mSDsluCounter, 6617 SdHoareTripleChecker+Invalid, 5.9s 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.9s 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 1724 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 42.3s 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-16 17:08:36,152 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-16 17:08:36,216 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_operatoramount_amount100_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 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:08:38,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:08:38,334 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:08:38,340 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:08:38,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:08:38,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:08:38,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:08:38,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:08:38,371 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:08:38,375 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:08:38,375 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:08:38,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:08:38,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:08:38,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:08:38,377 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:08:38,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:08:38,377 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:08:38,378 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:08:38,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:08:38,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:08:38,378 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:08:38,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:08:38,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:08:38,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:08:38,380 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:08:38,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:08:38,381 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:08:38,381 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:08:38,381 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:08:38,381 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:08:38,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:08:38,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:08:38,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:08:38,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:08:38,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:08:38,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:08:38,383 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:08:38,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:08:38,383 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:08:38,384 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:08:38,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:08:38,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:08:38,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:08:38,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:08:38,385 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 -> 4530217ca1f20f3cb75b415cf917b29c2da92488d9a0626f4e89358462ce0871 [2024-11-16 17:08:38,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:08:38,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:08:38,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:08:38,758 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:08:38,758 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:08:38,759 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-16 17:08:40,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:08:40,526 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:08:40,526 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i [2024-11-16 17:08:40,539 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85789cff6/8f7a7c292dac4c5aa61b21add298798e/FLAG605c25123 [2024-11-16 17:08:40,559 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85789cff6/8f7a7c292dac4c5aa61b21add298798e [2024-11-16 17:08:40,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:08:40,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:08:40,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:08:40,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:08:40,571 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:08:40,574 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:08:40" (1/1) ... [2024-11-16 17:08:40,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347161e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:40, skipping insertion in model container [2024-11-16 17:08:40,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:08:40" (1/1) ... [2024-11-16 17:08:40,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:08:40,803 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-11-16 17:08:40,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:08:40,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:08:40,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-61.i[916,929] [2024-11-16 17:08:40,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:08:41,019 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:08:41,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41 WrapperNode [2024-11-16 17:08:41,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:08:41,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:08:41,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:08:41,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:08:41,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,079 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-16 17:08:41,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:08:41,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:08:41,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:08:41,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:08:41,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,117 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:08:41,117 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,118 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,144 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,150 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:08:41,159 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:08:41,159 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:08:41,159 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:08:41,160 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (1/1) ... [2024-11-16 17:08:41,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:08:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:08:41,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:08:41,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:08:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:08:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:08:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:08:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:08:41,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:08:41,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:08:41,323 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:08:41,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:08:42,130 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-16 17:08:42,130 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:08:42,147 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:08:42,148 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:08:42,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:08:42 BoogieIcfgContainer [2024-11-16 17:08:42,149 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:08:42,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:08:42,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:08:42,155 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:08:42,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:08:40" (1/3) ... [2024-11-16 17:08:42,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:08:42, skipping insertion in model container [2024-11-16 17:08:42,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:08:41" (2/3) ... [2024-11-16 17:08:42,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6fbee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:08:42, skipping insertion in model container [2024-11-16 17:08:42,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:08:42" (3/3) ... [2024-11-16 17:08:42,160 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-61.i [2024-11-16 17:08:42,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:08:42,178 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:08:42,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:08:42,260 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;@4f918bb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:08:42,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:08:42,265 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-16 17:08:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 17:08:42,284 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:42,284 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-16 17:08:42,285 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:42,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:42,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1029183383, now seen corresponding path program 1 times [2024-11-16 17:08:42,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:08:42,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878659233] [2024-11-16 17:08:42,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:42,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:08:42,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:08:42,310 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:08:42,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:08:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:42,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:08:42,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:42,762 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-16 17:08:42,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:08:42,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:08:42,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878659233] [2024-11-16 17:08:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878659233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:08:42,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:08:42,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:08:42,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210827932] [2024-11-16 17:08:42,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:08:42,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:08:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:08:42,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:08:42,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:08:42,796 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-16 17:08:42,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:08:42,826 INFO L93 Difference]: Finished difference Result 168 states and 293 transitions. [2024-11-16 17:08:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:08:42,828 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-16 17:08:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:08:42,837 INFO L225 Difference]: With dead ends: 168 [2024-11-16 17:08:42,838 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 17:08:42,843 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-16 17:08:42,846 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-16 17:08:42,847 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-16 17:08:42,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 17:08:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 17:08:42,890 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-16 17:08:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 129 transitions. [2024-11-16 17:08:42,898 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 129 transitions. Word has length 170 [2024-11-16 17:08:42,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:08:42,899 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 129 transitions. [2024-11-16 17:08:42,899 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-16 17:08:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 129 transitions. [2024-11-16 17:08:42,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-16 17:08:42,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:42,903 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-16 17:08:42,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 17:08:43,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:08:43,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:43,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1550949875, now seen corresponding path program 1 times [2024-11-16 17:08:43,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:08:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964615767] [2024-11-16 17:08:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:08:43,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:08:43,114 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:08:43,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:08:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:43,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 17:08:43,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:43,853 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-16 17:08:43,853 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:08:44,204 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-16 17:08:44,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:08:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964615767] [2024-11-16 17:08:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964615767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:08:44,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:08:44,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-16 17:08:44,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386946500] [2024-11-16 17:08:44,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:08:44,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:08:44,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:08:44,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:08:44,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:08:44,214 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-16 17:08:45,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:08:45,228 INFO L93 Difference]: Finished difference Result 257 states and 391 transitions. [2024-11-16 17:08:45,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 17:08:45,229 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-16 17:08:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:08:45,233 INFO L225 Difference]: With dead ends: 257 [2024-11-16 17:08:45,233 INFO L226 Difference]: Without dead ends: 177 [2024-11-16 17:08:45,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-16 17:08:45,235 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-16 17:08:45,236 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.7s Time] [2024-11-16 17:08:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-16 17:08:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 92. [2024-11-16 17:08:45,263 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-16 17:08:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2024-11-16 17:08:45,265 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 170 [2024-11-16 17:08:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:08:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2024-11-16 17:08:45,266 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-16 17:08:45,266 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2024-11-16 17:08:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-16 17:08:45,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:08:45,269 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-16 17:08:45,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 17:08:45,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:08:45,470 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:08:45,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:08:45,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1036522903, now seen corresponding path program 1 times [2024-11-16 17:08:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:08:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604347804] [2024-11-16 17:08:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:08:45,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:08:45,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:08:45,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:08:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:45,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 17:08:45,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:08:47,384 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-16 17:08:47,385 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:08:47,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:08:47,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604347804] [2024-11-16 17:08:47,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604347804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:08:47,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1499146996] [2024-11-16 17:08:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:08:47,627 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 17:08:47,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 17:08:47,631 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-16 17:08:47,633 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-16 17:08:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:08:48,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 17:08:48,311 INFO L278 TraceCheckSpWp]: Computing forward predicates...