./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.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_loopvsstraightlinecode_50-1loop_file-78.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 3281886f5c5206f30736e8b4fb1f47759c44ed0cd56792088c8ce26da268bde9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:47:34,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:47:34,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 16:47:34,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:47:34,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:47:35,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:47:35,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:47:35,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:47:35,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:47:35,020 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:47:35,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:47:35,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:47:35,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:47:35,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:47:35,023 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:47:35,023 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:47:35,025 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:47:35,025 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:47:35,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 16:47:35,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:47:35,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:47:35,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:47:35,027 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:47:35,027 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:47:35,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:47:35,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:47:35,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:47:35,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:47:35,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:47:35,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:47:35,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:47:35,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:47:35,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:47:35,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:47:35,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:47:35,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:47:35,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 16:47:35,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 16:47:35,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:47:35,030 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:47:35,030 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:47:35,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:47:35,031 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 -> 3281886f5c5206f30736e8b4fb1f47759c44ed0cd56792088c8ce26da268bde9 [2024-11-16 16:47:35,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:47:35,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:47:35,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:47:35,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:47:35,284 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:47:35,285 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:36,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:47:36,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:47:36,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:36,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02030bc81/423b65cf20c846d5847f984114bc60d5/FLAGa41be7d48 [2024-11-16 16:47:36,843 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02030bc81/423b65cf20c846d5847f984114bc60d5 [2024-11-16 16:47:36,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:47:36,847 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:47:36,848 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:47:36,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:47:36,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:47:36,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:47:36" (1/1) ... [2024-11-16 16:47:36,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f2d875f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:36, skipping insertion in model container [2024-11-16 16:47:36,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:47:36" (1/1) ... [2024-11-16 16:47:36,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:47:37,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i[915,928] [2024-11-16 16:47:37,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:47:37,200 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:47:37,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i[915,928] [2024-11-16 16:47:37,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:47:37,259 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:47:37,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37 WrapperNode [2024-11-16 16:47:37,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:47:37,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:47:37,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:47:37,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:47:37,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,279 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,315 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-16 16:47:37,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:47:37,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:47:37,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:47:37,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:47:37,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,367 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 16:47:37,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,382 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:47:37,399 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:47:37,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:47:37,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:47:37,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (1/1) ... [2024-11-16 16:47:37,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:47:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:47:37,441 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 16:47:37,446 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 16:47:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:47:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:47:37,485 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:47:37,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 16:47:37,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:47:37,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:47:37,579 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:47:37,582 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:47:37,993 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc property_#t~bitwise17#1;havoc property_#t~short18#1;havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-16 16:47:38,023 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 16:47:38,025 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:47:38,054 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:47:38,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:47:38,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:47:38 BoogieIcfgContainer [2024-11-16 16:47:38,056 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:47:38,059 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:47:38,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:47:38,061 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:47:38,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:47:36" (1/3) ... [2024-11-16 16:47:38,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7bc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:47:38, skipping insertion in model container [2024-11-16 16:47:38,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:37" (2/3) ... [2024-11-16 16:47:38,063 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c7bc19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:47:38, skipping insertion in model container [2024-11-16 16:47:38,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:47:38" (3/3) ... [2024-11-16 16:47:38,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:38,082 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:47:38,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:47:38,146 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:47:38,153 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;@6b733618, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:47:38,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:47:38,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:47:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:47:38,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:38,183 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:38,183 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1415239341, now seen corresponding path program 1 times [2024-11-16 16:47:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437869144] [2024-11-16 16:47:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:38,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:38,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:38,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437869144] [2024-11-16 16:47:38,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437869144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:38,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:38,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:47:38,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008138998] [2024-11-16 16:47:38,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:38,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:47:38,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:38,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:47:38,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:47:38,554 INFO L87 Difference]: Start difference. First operand has 81 states, 60 states have (on average 1.4) internal successors, (84), 61 states have internal predecessors, (84), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:38,585 INFO L93 Difference]: Finished difference Result 158 states and 254 transitions. [2024-11-16 16:47:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:47:38,588 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 126 [2024-11-16 16:47:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:38,595 INFO L225 Difference]: With dead ends: 158 [2024-11-16 16:47:38,595 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 16:47:38,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 16:47:38,602 INFO L432 NwaCegarLoop]: 112 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, 112 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 16:47:38,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:47:38,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 16:47:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-16 16:47:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:47:38,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2024-11-16 16:47:38,666 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 126 [2024-11-16 16:47:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:38,666 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 112 transitions. [2024-11-16 16:47:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2024-11-16 16:47:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-16 16:47:38,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:38,670 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:38,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 16:47:38,670 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:38,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:38,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1031172199, now seen corresponding path program 1 times [2024-11-16 16:47:38,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:38,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367739292] [2024-11-16 16:47:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:38,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:38,912 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:38,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:38,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367739292] [2024-11-16 16:47:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367739292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:38,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:47:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543084019] [2024-11-16 16:47:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:47:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:47:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:47:38,919 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:38,959 INFO L93 Difference]: Finished difference Result 149 states and 221 transitions. [2024-11-16 16:47:38,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:47:38,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-16 16:47:38,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:38,961 INFO L225 Difference]: With dead ends: 149 [2024-11-16 16:47:38,961 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 16:47:38,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:47:38,963 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:38,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 308 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:47:38,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 16:47:38,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-16 16:47:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:47:38,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2024-11-16 16:47:38,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 126 [2024-11-16 16:47:38,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:38,976 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2024-11-16 16:47:38,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2024-11-16 16:47:38,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 16:47:38,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:38,979 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 16:47:38,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:38,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash -2085939752, now seen corresponding path program 1 times [2024-11-16 16:47:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726280635] [2024-11-16 16:47:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:39,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:39,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726280635] [2024-11-16 16:47:39,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726280635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:39,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:39,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:47:39,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001794973] [2024-11-16 16:47:39,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:39,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:47:39,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:39,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:47:39,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:47:39,353 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:39,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:39,524 INFO L93 Difference]: Finished difference Result 224 states and 329 transitions. [2024-11-16 16:47:39,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:47:39,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2024-11-16 16:47:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:39,527 INFO L225 Difference]: With dead ends: 224 [2024-11-16 16:47:39,530 INFO L226 Difference]: Without dead ends: 151 [2024-11-16 16:47:39,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:47:39,531 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 87 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:39,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 283 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:47:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-16 16:47:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2024-11-16 16:47:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 16:47:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 195 transitions. [2024-11-16 16:47:39,562 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 195 transitions. Word has length 127 [2024-11-16 16:47:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:39,563 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 195 transitions. [2024-11-16 16:47:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 195 transitions. [2024-11-16 16:47:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-16 16:47:39,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:39,565 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 16:47:39,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:39,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1756676800, now seen corresponding path program 1 times [2024-11-16 16:47:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612436953] [2024-11-16 16:47:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:39,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:39,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612436953] [2024-11-16 16:47:39,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612436953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:47:39,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485723487] [2024-11-16 16:47:39,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:39,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:47:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:39,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:47:39,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:47:39,778 INFO L87 Difference]: Start difference. First operand 132 states and 195 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:39,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:39,911 INFO L93 Difference]: Finished difference Result 318 states and 467 transitions. [2024-11-16 16:47:39,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:47:39,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-16 16:47:39,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:39,915 INFO L225 Difference]: With dead ends: 318 [2024-11-16 16:47:39,917 INFO L226 Difference]: Without dead ends: 230 [2024-11-16 16:47:39,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:47:39,918 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 126 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:39,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 310 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:47:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-16 16:47:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 209. [2024-11-16 16:47:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 151 states have internal predecessors, (200), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 16:47:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 308 transitions. [2024-11-16 16:47:39,963 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 308 transitions. Word has length 128 [2024-11-16 16:47:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:39,963 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 308 transitions. [2024-11-16 16:47:39,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 308 transitions. [2024-11-16 16:47:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 16:47:39,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:39,965 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 16:47:39,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:39,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash 591882203, now seen corresponding path program 1 times [2024-11-16 16:47:39,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:39,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855252178] [2024-11-16 16:47:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:40,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:40,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855252178] [2024-11-16 16:47:40,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855252178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:40,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:40,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 16:47:40,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227225145] [2024-11-16 16:47:40,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:40,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 16:47:40,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:40,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 16:47:40,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:47:40,211 INFO L87 Difference]: Start difference. First operand 209 states and 308 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:40,500 INFO L93 Difference]: Finished difference Result 598 states and 871 transitions. [2024-11-16 16:47:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 16:47:40,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-16 16:47:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:40,503 INFO L225 Difference]: With dead ends: 598 [2024-11-16 16:47:40,503 INFO L226 Difference]: Without dead ends: 444 [2024-11-16 16:47:40,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-16 16:47:40,505 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 274 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:40,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 769 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 16:47:40,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-16 16:47:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 371. [2024-11-16 16:47:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 275 states have (on average 1.3454545454545455) internal successors, (370), 275 states have internal predecessors, (370), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 16:47:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 550 transitions. [2024-11-16 16:47:40,535 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 550 transitions. Word has length 129 [2024-11-16 16:47:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:40,536 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 550 transitions. [2024-11-16 16:47:40,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 550 transitions. [2024-11-16 16:47:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 16:47:40,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:40,537 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:40,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 16:47:40,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1205069156, now seen corresponding path program 1 times [2024-11-16 16:47:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624359342] [2024-11-16 16:47:40,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:40,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:40,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624359342] [2024-11-16 16:47:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624359342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:47:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388320551] [2024-11-16 16:47:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:40,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:47:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:47:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:47:40,832 INFO L87 Difference]: Start difference. First operand 371 states and 550 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:40,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:40,983 INFO L93 Difference]: Finished difference Result 765 states and 1123 transitions. [2024-11-16 16:47:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:47:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-16 16:47:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:40,987 INFO L225 Difference]: With dead ends: 765 [2024-11-16 16:47:40,987 INFO L226 Difference]: Without dead ends: 438 [2024-11-16 16:47:40,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:47:40,989 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 79 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:40,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 283 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:47:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-16 16:47:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 379. [2024-11-16 16:47:41,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 283 states have (on average 1.332155477031802) internal successors, (377), 283 states have internal predecessors, (377), 90 states have call successors, (90), 5 states have call predecessors, (90), 5 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-16 16:47:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 557 transitions. [2024-11-16 16:47:41,024 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 557 transitions. Word has length 129 [2024-11-16 16:47:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:41,025 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 557 transitions. [2024-11-16 16:47:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 557 transitions. [2024-11-16 16:47:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 16:47:41,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:41,026 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:41,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 16:47:41,026 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:41,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:41,027 INFO L85 PathProgramCache]: Analyzing trace with hash 15099964, now seen corresponding path program 1 times [2024-11-16 16:47:41,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:41,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225255848] [2024-11-16 16:47:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:41,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:41,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:41,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:41,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225255848] [2024-11-16 16:47:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225255848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:41,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:47:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406911663] [2024-11-16 16:47:41,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:41,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:47:41,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:41,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:47:41,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:47:41,336 INFO L87 Difference]: Start difference. First operand 379 states and 557 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:41,531 INFO L93 Difference]: Finished difference Result 967 states and 1415 transitions. [2024-11-16 16:47:41,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:47:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-16 16:47:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:41,534 INFO L225 Difference]: With dead ends: 967 [2024-11-16 16:47:41,534 INFO L226 Difference]: Without dead ends: 628 [2024-11-16 16:47:41,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:47:41,537 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 131 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:41,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 435 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:47:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2024-11-16 16:47:41,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 534. [2024-11-16 16:47:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 400 states have (on average 1.33) internal successors, (532), 400 states have internal predecessors, (532), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-16 16:47:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 784 transitions. [2024-11-16 16:47:41,575 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 784 transitions. Word has length 130 [2024-11-16 16:47:41,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:41,576 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 784 transitions. [2024-11-16 16:47:41,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:41,576 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 784 transitions. [2024-11-16 16:47:41,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 16:47:41,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:41,577 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:41,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 16:47:41,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:41,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:41,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1259864445, now seen corresponding path program 1 times [2024-11-16 16:47:41,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:41,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197932378] [2024-11-16 16:47:41,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:41,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:41,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:41,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:41,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197932378] [2024-11-16 16:47:41,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197932378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:41,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:41,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 16:47:41,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258241893] [2024-11-16 16:47:41,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:41,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:47:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:47:41,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:47:41,830 INFO L87 Difference]: Start difference. First operand 534 states and 784 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:41,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:41,970 INFO L93 Difference]: Finished difference Result 1124 states and 1658 transitions. [2024-11-16 16:47:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 16:47:41,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-16 16:47:41,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:41,973 INFO L225 Difference]: With dead ends: 1124 [2024-11-16 16:47:41,973 INFO L226 Difference]: Without dead ends: 687 [2024-11-16 16:47:41,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:47:41,975 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 43 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:41,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 491 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 16:47:41,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-16 16:47:42,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 612. [2024-11-16 16:47:42,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 612 states, 478 states have (on average 1.3368200836820083) internal successors, (639), 478 states have internal predecessors, (639), 126 states have call successors, (126), 7 states have call predecessors, (126), 7 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-16 16:47:42,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 891 transitions. [2024-11-16 16:47:42,012 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 891 transitions. Word has length 130 [2024-11-16 16:47:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 612 states and 891 transitions. [2024-11-16 16:47:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 891 transitions. [2024-11-16 16:47:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 16:47:42,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:42,014 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:42,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 16:47:42,014 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:42,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:42,014 INFO L85 PathProgramCache]: Analyzing trace with hash 934291128, now seen corresponding path program 1 times [2024-11-16 16:47:42,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:42,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664720689] [2024-11-16 16:47:42,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:42,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:47:42,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918101248] [2024-11-16 16:47:42,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:42,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:47:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:47:42,080 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 16:47:42,081 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 16:47:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:42,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 16:47:42,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:47:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 191 proven. 42 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-16 16:47:42,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:47:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:43,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664720689] [2024-11-16 16:47:43,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 16:47:43,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918101248] [2024-11-16 16:47:43,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918101248] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:47:43,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:47:43,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-16 16:47:43,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901996388] [2024-11-16 16:47:43,110 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 16:47:43,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 16:47:43,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:43,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 16:47:43,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:47:43,111 INFO L87 Difference]: Start difference. First operand 612 states and 891 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:43,665 INFO L93 Difference]: Finished difference Result 1484 states and 2114 transitions. [2024-11-16 16:47:43,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 16:47:43,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2024-11-16 16:47:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:43,669 INFO L225 Difference]: With dead ends: 1484 [2024-11-16 16:47:43,669 INFO L226 Difference]: Without dead ends: 1096 [2024-11-16 16:47:43,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-16 16:47:43,671 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 111 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:43,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 524 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 16:47:43,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2024-11-16 16:47:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1050. [2024-11-16 16:47:43,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 820 states have (on average 1.3195121951219513) internal successors, (1082), 824 states have internal predecessors, (1082), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-16 16:47:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1494 transitions. [2024-11-16 16:47:43,726 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1494 transitions. Word has length 135 [2024-11-16 16:47:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:43,727 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1494 transitions. [2024-11-16 16:47:43,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1494 transitions. [2024-11-16 16:47:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 16:47:43,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:43,728 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:43,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 16:47:43,932 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 16:47:43,933 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:43,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1656176218, now seen corresponding path program 1 times [2024-11-16 16:47:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:43,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843520745] [2024-11-16 16:47:43,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 16:47:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 16:47:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 16:47:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 16:47:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 16:47:44,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 16:47:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 16:47:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 16:47:44,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 16:47:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 16:47:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 16:47:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-16 16:47:44,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 16:47:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 16:47:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 16:47:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 16:47:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 16:47:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 16:47:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:47:44,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 16:47:44,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843520745] [2024-11-16 16:47:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843520745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:44,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:47:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644070793] [2024-11-16 16:47:44,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:44,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:47:44,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 16:47:44,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:47:44,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:47:44,150 INFO L87 Difference]: Start difference. First operand 1050 states and 1494 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:44,258 INFO L93 Difference]: Finished difference Result 1818 states and 2612 transitions. [2024-11-16 16:47:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:47:44,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2024-11-16 16:47:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:44,267 INFO L225 Difference]: With dead ends: 1818 [2024-11-16 16:47:44,267 INFO L226 Difference]: Without dead ends: 1396 [2024-11-16 16:47:44,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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 16:47:44,271 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 70 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 16:47:44,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 424 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:47:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-16 16:47:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1053. [2024-11-16 16:47:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1053 states, 823 states have (on average 1.3183475091130012) internal successors, (1085), 827 states have internal predecessors, (1085), 206 states have call successors, (206), 23 states have call predecessors, (206), 23 states have return successors, (206), 202 states have call predecessors, (206), 206 states have call successors, (206) [2024-11-16 16:47:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1497 transitions. [2024-11-16 16:47:44,340 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1497 transitions. Word has length 135 [2024-11-16 16:47:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 1053 states and 1497 transitions. [2024-11-16 16:47:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:47:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1497 transitions. [2024-11-16 16:47:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 16:47:44,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:44,345 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:44,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 16:47:44,345 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:44,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1145642041, now seen corresponding path program 1 times [2024-11-16 16:47:44,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 16:47:44,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246665662] [2024-11-16 16:47:44,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:44,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 16:47:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 16:47:44,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046409273] [2024-11-16 16:47:44,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:44,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 16:47:44,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:47:44,400 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 16:47:44,402 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 16:47:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:47:44,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 16:47:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 16:47:44,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 16:47:44,649 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 16:47:44,650 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 16:47:44,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 16:47:44,852 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,SelfDestructingSolverStorable10 [2024-11-16 16:47:44,855 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 16:47:44,920 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 16:47:44,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:47:44 BoogieIcfgContainer [2024-11-16 16:47:44,923 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 16:47:44,923 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 16:47:44,923 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 16:47:44,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 16:47:44,924 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:47:38" (3/4) ... [2024-11-16 16:47:44,926 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 16:47:44,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 16:47:44,928 INFO L158 Benchmark]: Toolchain (without parser) took 8081.14ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 112.9MB in the beginning and 132.1MB in the end (delta: -19.2MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,928 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:47:44,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.43ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 147.4MB in the end (delta: -34.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.52ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 140.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,929 INFO L158 Benchmark]: Boogie Preprocessor took 81.76ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 129.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,929 INFO L158 Benchmark]: IcfgBuilder took 658.05ms. Allocated memory is still 184.5MB. Free memory was 129.4MB in the beginning and 95.8MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,930 INFO L158 Benchmark]: TraceAbstraction took 6864.19ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 94.9MB in the beginning and 132.1MB in the end (delta: -37.2MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. [2024-11-16 16:47:44,930 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 369.1MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 16:47:44,931 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 184.5MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.43ms. Allocated memory is still 184.5MB. Free memory was 112.5MB in the beginning and 147.4MB in the end (delta: -34.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.52ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 140.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.76ms. Allocated memory is still 184.5MB. Free memory was 140.8MB in the beginning and 129.4MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * IcfgBuilder took 658.05ms. Allocated memory is still 184.5MB. Free memory was 129.4MB in the beginning and 95.8MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6864.19ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 94.9MB in the beginning and 132.1MB in the end (delta: -37.2MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 369.1MB. Free memory is still 132.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of bitwiseOr at line 119, overapproximation of someBinaryArithmeticDOUBLEoperation at line 64. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -4; [L23] unsigned char var_1_3 = 64; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 2; [L26] unsigned short int var_1_6 = 10; [L27] double var_1_8 = 1.875; [L28] signed long int var_1_9 = -4; [L29] double var_1_10 = 63.5; [L30] double var_1_11 = 255.375; [L31] double var_1_12 = 999999999.525; [L32] double var_1_13 = 63.75; [L33] double var_1_14 = 0.625; [L34] unsigned short int var_1_15 = 5; [L35] signed char var_1_16 = 4; [L36] signed char var_1_17 = 0; [L37] signed char var_1_18 = -2; [L38] signed char var_1_19 = 1; [L39] unsigned short int var_1_20 = 50; [L40] unsigned short int var_1_21 = 0; [L41] unsigned char last_1_var_1_3 = 64; [L42] unsigned short int last_1_var_1_6 = 10; [L43] unsigned short int last_1_var_1_15 = 5; [L44] unsigned short int last_1_var_1_20 = 50; [L45] unsigned short int last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L112] last_1_var_1_3 = var_1_3 [L113] last_1_var_1_6 = var_1_6 [L114] last_1_var_1_15 = var_1_15 [L115] last_1_var_1_20 = var_1_20 [L116] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=0, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L83] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=2, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L86] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=-4] [L87] var_1_9 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L88] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L89] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L90] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_10=127/2, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L91] var_1_10 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L92] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_11=2043/8, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L93] var_1_11 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L94] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_12=39999999981/40, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L95] var_1_12 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L96] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_13=255/4, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L97] var_1_13 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L98] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_14=5/8, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L99] var_1_14 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L100] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=0, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L101] var_1_17 = __VERIFIER_nondet_char() [L102] CALL assume_abort_if_not(var_1_17 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L102] RET assume_abort_if_not(var_1_17 >= -63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L103] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=-2, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L104] var_1_18 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L105] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L106] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=1, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L107] var_1_19 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_19 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L108] RET assume_abort_if_not(var_1_19 >= -31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] CALL assume_abort_if_not(var_1_19 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L109] RET assume_abort_if_not(var_1_19 <= 31) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L128] RET updateVariables() [L129] CALL step() [L49] signed long int stepLocal_0 = last_1_var_1_21; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_0=0, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L50] COND FALSE !(last_1_var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L53] signed long int stepLocal_2 = last_1_var_1_20 ^ last_1_var_1_15; [L54] unsigned char stepLocal_1 = var_1_5; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, stepLocal_2=1, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L55] COND FALSE !(stepLocal_2 < -256) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_1=197, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L58] COND FALSE !(stepLocal_1 <= 50) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=50, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L62] var_1_20 = (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_8=15/8, var_1_9=66] [L63] COND TRUE var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9)))) [L64] var_1_8 = ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=5, var_1_16=4, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=-4, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L70] var_1_16 = (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))))) [L71] var_1_1 = ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) [L72] unsigned short int stepLocal_3 = var_1_6; VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] EXPR (var_1_3 * var_1_17) & (var_1_1 * var_1_18) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, stepLocal_3=10, var_1_15=5, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L73] COND FALSE !(stepLocal_3 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) [L76] COND TRUE ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21 [L77] var_1_15 = ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L129] RET step() [L130] CALL, EXPR property() [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR last_1_var_1_20 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR ((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1)) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119] EXPR (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L119-L120] return (((((((var_1_1 == ((signed long int) ((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) && ((last_1_var_1_6 < last_1_var_1_21) ? (var_1_3 == ((unsigned char) ((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))))) : 1)) && (((last_1_var_1_20 ^ last_1_var_1_15) < -256) ? (var_1_6 == ((unsigned short int) (((((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) < 0 ) ? -((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))) : ((((((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) > ((last_1_var_1_20 + last_1_var_1_3))) ? (((((var_1_5) > (var_1_4)) ? (var_1_5) : (var_1_4)))) : ((last_1_var_1_20 + last_1_var_1_3)))))))) : ((var_1_5 <= 50) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1))) && ((var_1_3 < (var_1_5 % ((((32) > (var_1_9)) ? (32) : (var_1_9))))) ? (var_1_8 == ((double) ((((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))) - var_1_12) + (var_1_13 - var_1_14)))) : ((var_1_13 <= (var_1_14 + var_1_11)) ? (var_1_8 == ((double) var_1_12)) : 1))) && ((((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) > var_1_21) ? (var_1_15 == ((unsigned short int) ((((var_1_3) > ((var_1_5 + var_1_4))) ? (var_1_3) : ((var_1_5 + var_1_4)))))) : 1)) && (var_1_16 == ((signed char) (var_1_17 + (var_1_18 + ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))))))) && (var_1_20 == ((unsigned short int) (((((var_1_5 + var_1_6)) > (var_1_4)) ? ((var_1_5 + var_1_6)) : (var_1_4)))))) && ((var_1_6 == ((var_1_3 * var_1_17) & (var_1_1 * var_1_18))) ? (var_1_21 == ((unsigned short int) (var_1_4 + 128))) : 1) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=5, last_1_var_1_20=50, last_1_var_1_21=0, last_1_var_1_3=64, last_1_var_1_6=10, var_1_15=404, var_1_16=0, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=207, var_1_21=0, var_1_3=64, var_1_4=207, var_1_5=197, var_1_6=10, var_1_9=66] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 925 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 921 mSDsluCounter, 3939 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2806 mSDsCounter, 291 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 930 IncrementalHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 291 mSolverCounterUnsat, 1133 mSDtfsCounter, 930 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 573 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1053occurred in iteration=10, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 730 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1285 ConstructedInterpolants, 0 QuantifiedInterpolants, 4021 SizeOfPredicates, 3 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6078/6120 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 16:47:44,953 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.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 3281886f5c5206f30736e8b4fb1f47759c44ed0cd56792088c8ce26da268bde9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 16:47:47,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 16:47:47,236 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 16:47:47,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 16:47:47,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 16:47:47,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 16:47:47,288 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 16:47:47,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 16:47:47,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 16:47:47,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 16:47:47,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 16:47:47,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 16:47:47,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 16:47:47,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 16:47:47,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 16:47:47,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 16:47:47,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 16:47:47,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 16:47:47,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 16:47:47,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 16:47:47,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 16:47:47,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 16:47:47,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 16:47:47,299 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 16:47:47,299 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 16:47:47,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 16:47:47,299 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 16:47:47,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 16:47:47,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 16:47:47,300 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 16:47:47,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 16:47:47,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 16:47:47,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 16:47:47,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 16:47:47,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:47:47,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 16:47:47,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 16:47:47,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 16:47:47,301 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 16:47:47,301 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 16:47:47,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 16:47:47,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 16:47:47,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 16:47:47,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 16:47:47,304 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 -> 3281886f5c5206f30736e8b4fb1f47759c44ed0cd56792088c8ce26da268bde9 [2024-11-16 16:47:47,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 16:47:47,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 16:47:47,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 16:47:47,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 16:47:47,577 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 16:47:47,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:48,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 16:47:49,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 16:47:49,233 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:49,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596db092e/172ef00864954f0c8a6e13eb6f44e079/FLAG0e8aee984 [2024-11-16 16:47:49,254 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/596db092e/172ef00864954f0c8a6e13eb6f44e079 [2024-11-16 16:47:49,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 16:47:49,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 16:47:49,258 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 16:47:49,258 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 16:47:49,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 16:47:49,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33928104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49, skipping insertion in model container [2024-11-16 16:47:49,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,287 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 16:47:49,416 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i[915,928] [2024-11-16 16:47:49,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:47:49,486 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 16:47:49,498 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-78.i[915,928] [2024-11-16 16:47:49,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 16:47:49,565 INFO L204 MainTranslator]: Completed translation [2024-11-16 16:47:49,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49 WrapperNode [2024-11-16 16:47:49,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 16:47:49,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 16:47:49,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 16:47:49,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 16:47:49,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,607 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-16 16:47:49,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 16:47:49,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 16:47:49,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 16:47:49,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 16:47:49,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,628 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 16:47:49,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,639 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 16:47:49,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 16:47:49,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 16:47:49,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 16:47:49,657 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (1/1) ... [2024-11-16 16:47:49,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 16:47:49,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 16:47:49,683 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 16:47:49,692 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 16:47:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 16:47:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 16:47:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 16:47:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 16:47:49,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 16:47:49,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 16:47:49,832 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 16:47:49,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 16:47:58,101 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-16 16:47:58,101 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 16:47:58,110 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 16:47:58,110 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 16:47:58,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:47:58 BoogieIcfgContainer [2024-11-16 16:47:58,111 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 16:47:58,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 16:47:58,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 16:47:58,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 16:47:58,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 04:47:49" (1/3) ... [2024-11-16 16:47:58,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153338c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:47:58, skipping insertion in model container [2024-11-16 16:47:58,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 04:47:49" (2/3) ... [2024-11-16 16:47:58,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153338c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 04:47:58, skipping insertion in model container [2024-11-16 16:47:58,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 04:47:58" (3/3) ... [2024-11-16 16:47:58,117 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-78.i [2024-11-16 16:47:58,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 16:47:58,128 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 16:47:58,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 16:47:58,173 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;@10af89b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 16:47:58,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 16:47:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:47:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:47:58,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:58,184 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:58,185 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:58,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -788996228, now seen corresponding path program 1 times [2024-11-16 16:47:58,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:47:58,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11124285] [2024-11-16 16:47:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:58,200 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 16:47:58,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:47:58,217 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 16:47:58,219 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 16:47:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:58,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 16:47:58,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:47:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-16 16:47:58,633 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:47:58,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:47:58,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11124285] [2024-11-16 16:47:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11124285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:47:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:47:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 16:47:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111128519] [2024-11-16 16:47:58,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:47:58,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 16:47:58,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:47:58,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 16:47:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 16:47:58,662 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.3) internal successors, (52), 41 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:58,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:47:58,683 INFO L93 Difference]: Finished difference Result 118 states and 190 transitions. [2024-11-16 16:47:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 16:47:58,685 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2024-11-16 16:47:58,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:47:58,690 INFO L225 Difference]: With dead ends: 118 [2024-11-16 16:47:58,690 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 16:47:58,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 119 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 16:47:58,695 INFO L432 NwaCegarLoop]: 84 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, 84 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 16:47:58,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 16:47:58,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 16:47:58,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 16:47:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-16 16:47:58,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-16 16:47:58,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 120 [2024-11-16 16:47:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:47:58,727 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-16 16:47:58,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 16:47:58,728 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-16 16:47:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:47:58,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:47:58,732 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:47:58,745 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 16:47:58,936 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 16:47:58,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:47:58,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:47:58,938 INFO L85 PathProgramCache]: Analyzing trace with hash 911264950, now seen corresponding path program 1 times [2024-11-16 16:47:58,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:47:58,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91298791] [2024-11-16 16:47:58,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:47:58,939 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 16:47:58,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:47:58,940 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 16:47:58,943 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 16:47:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:47:59,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:47:59,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:48:00,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:48:00,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:48:00,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91298791] [2024-11-16 16:48:00,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91298791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:48:00,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:48:00,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 16:48:00,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557439684] [2024-11-16 16:48:00,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:48:00,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:48:00,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:48:00,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:48:00,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:48:00,571 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:03,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:06,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:08,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:48:08,047 INFO L93 Difference]: Finished difference Result 177 states and 253 transitions. [2024-11-16 16:48:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:48:08,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-16 16:48:08,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:48:08,083 INFO L225 Difference]: With dead ends: 177 [2024-11-16 16:48:08,083 INFO L226 Difference]: Without dead ends: 124 [2024-11-16 16:48:08,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 16:48:08,086 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 64 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-16 16:48:08,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 278 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-16 16:48:08,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-16 16:48:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-11-16 16:48:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 16:48:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-11-16 16:48:08,129 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 120 [2024-11-16 16:48:08,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:48:08,131 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-11-16 16:48:08,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-11-16 16:48:08,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-16 16:48:08,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:48:08,136 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:08,166 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 (3)] Ended with exit code 0 [2024-11-16 16:48:08,337 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 16:48:08,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:48:08,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:48:08,338 INFO L85 PathProgramCache]: Analyzing trace with hash 617861943, now seen corresponding path program 1 times [2024-11-16 16:48:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:48:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670925705] [2024-11-16 16:48:08,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:08,342 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 16:48:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:48:08,347 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 16:48:08,348 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 16:48:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:08,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 16:48:08,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:48:08,696 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:48:08,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:48:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670925705] [2024-11-16 16:48:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670925705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:48:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:48:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:48:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807435593] [2024-11-16 16:48:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:48:08,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 16:48:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:48:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 16:48:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 16:48:08,698 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:10,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 16:48:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:48:10,921 INFO L93 Difference]: Finished difference Result 159 states and 231 transitions. [2024-11-16 16:48:10,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 16:48:10,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-16 16:48:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:48:10,953 INFO L225 Difference]: With dead ends: 159 [2024-11-16 16:48:10,954 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 16:48:10,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 118 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 16:48:10,956 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-16 16:48:10,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-16 16:48:10,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 16:48:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-16 16:48:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 67 states have internal predecessors, (80), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 16:48:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-11-16 16:48:10,990 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 120 [2024-11-16 16:48:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:48:10,991 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-11-16 16:48:10,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-11-16 16:48:10,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:48:10,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:48:10,992 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:11,005 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 (4)] Ended with exit code 0 [2024-11-16 16:48:11,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 16:48:11,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:48:11,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:48:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1464852811, now seen corresponding path program 1 times [2024-11-16 16:48:11,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:48:11,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954843085] [2024-11-16 16:48:11,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:11,194 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 16:48:11,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:48:11,197 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:48:11,197 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 (5)] Waiting until timeout for monitored process [2024-11-16 16:48:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:11,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 16:48:11,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:48:12,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:48:12,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:48:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954843085] [2024-11-16 16:48:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954843085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:48:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:48:12,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 16:48:12,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148065565] [2024-11-16 16:48:12,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:48:12,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 16:48:12,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:48:12,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 16:48:12,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 16:48:12,517 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:15,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:19,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:21,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:23,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:48:23,974 INFO L93 Difference]: Finished difference Result 289 states and 409 transitions. [2024-11-16 16:48:23,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 16:48:23,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-16 16:48:23,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:48:23,999 INFO L225 Difference]: With dead ends: 289 [2024-11-16 16:48:23,999 INFO L226 Difference]: Without dead ends: 236 [2024-11-16 16:48:24,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 16:48:24,005 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 148 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:48:24,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 280 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2024-11-16 16:48:24,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-16 16:48:24,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 196. [2024-11-16 16:48:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 119 states have internal predecessors, (139), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-16 16:48:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-11-16 16:48:24,082 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 121 [2024-11-16 16:48:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:48:24,083 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-11-16 16:48:24,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-11-16 16:48:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:48:24,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:48:24,086 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:24,104 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 16:48:24,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 16:48:24,288 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:48:24,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:48:24,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1942610804, now seen corresponding path program 1 times [2024-11-16 16:48:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:48:24,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066359119] [2024-11-16 16:48:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:24,290 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 16:48:24,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:48:24,294 INFO L229 MonitoredProcess]: Starting monitored process 6 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 16:48:24,302 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 (6)] Waiting until timeout for monitored process [2024-11-16 16:48:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:25,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 16:48:25,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-16 16:48:26,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 16:48:28,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:48:28,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066359119] [2024-11-16 16:48:28,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066359119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 16:48:28,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2122668410] [2024-11-16 16:48:28,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:28,461 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 16:48:28,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 16:48:28,463 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 16:48:28,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 16:48:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:29,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:48:29,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:48:30,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:48:30,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2122668410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:48:30,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 16:48:30,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-16 16:48:30,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791688753] [2024-11-16 16:48:30,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:48:30,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 16:48:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:48:30,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 16:48:30,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:48:30,480 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:33,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:38,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:39,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:41,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:46,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:46,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:48:46,135 INFO L93 Difference]: Finished difference Result 399 states and 564 transitions. [2024-11-16 16:48:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 16:48:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-16 16:48:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:48:46,138 INFO L225 Difference]: With dead ends: 399 [2024-11-16 16:48:46,138 INFO L226 Difference]: Without dead ends: 296 [2024-11-16 16:48:46,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2024-11-16 16:48:46,140 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 45 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.6s IncrementalHoareTripleChecker+Time [2024-11-16 16:48:46,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 209 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 123 Invalid, 2 Unknown, 0 Unchecked, 15.6s Time] [2024-11-16 16:48:46,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-16 16:48:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 288. [2024-11-16 16:48:46,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 185 states have (on average 1.1837837837837837) internal successors, (219), 187 states have internal predecessors, (219), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-16 16:48:46,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 407 transitions. [2024-11-16 16:48:46,168 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 407 transitions. Word has length 121 [2024-11-16 16:48:46,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:48:46,169 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 407 transitions. [2024-11-16 16:48:46,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:46,170 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 407 transitions. [2024-11-16 16:48:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:48:46,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:48:46,172 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:46,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-16 16:48:46,387 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 (6)] Forceful destruction successful, exit code 0 [2024-11-16 16:48:46,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /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 16:48:46,573 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:48:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:48:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash -332098548, now seen corresponding path program 1 times [2024-11-16 16:48:46,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:48:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1633157050] [2024-11-16 16:48:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:46,575 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 16:48:46,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:48:46,578 INFO L229 MonitoredProcess]: Starting monitored process 8 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 16:48:46,579 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 (8)] Waiting until timeout for monitored process [2024-11-16 16:48:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:46,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 16:48:46,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 16:48:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-16 16:48:47,765 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 16:48:47,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 16:48:47,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1633157050] [2024-11-16 16:48:47,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1633157050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 16:48:47,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 16:48:47,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 16:48:47,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647655641] [2024-11-16 16:48:47,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 16:48:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 16:48:47,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 16:48:47,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 16:48:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 16:48:47,767 INFO L87 Difference]: Start difference. First operand 288 states and 407 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:50,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:52,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:55,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 16:48:55,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 16:48:55,133 INFO L93 Difference]: Finished difference Result 413 states and 583 transitions. [2024-11-16 16:48:55,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 16:48:55,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-16 16:48:55,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 16:48:55,138 INFO L225 Difference]: With dead ends: 413 [2024-11-16 16:48:55,138 INFO L226 Difference]: Without dead ends: 291 [2024-11-16 16:48:55,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 16:48:55,139 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-11-16 16:48:55,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 174 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-11-16 16:48:55,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-16 16:48:55,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2024-11-16 16:48:55,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 185 states have (on average 1.1783783783783783) internal successors, (218), 187 states have internal predecessors, (218), 94 states have call successors, (94), 8 states have call predecessors, (94), 8 states have return successors, (94), 92 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-16 16:48:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 406 transitions. [2024-11-16 16:48:55,166 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 406 transitions. Word has length 121 [2024-11-16 16:48:55,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 16:48:55,167 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 406 transitions. [2024-11-16 16:48:55,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-16 16:48:55,167 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 406 transitions. [2024-11-16 16:48:55,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-16 16:48:55,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 16:48:55,168 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 16:48:55,182 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 (8)] Ended with exit code 0 [2024-11-16 16:48:55,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 16:48:55,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 16:48:55,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 16:48:55,369 INFO L85 PathProgramCache]: Analyzing trace with hash 555405133, now seen corresponding path program 1 times [2024-11-16 16:48:55,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 16:48:55,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672256298] [2024-11-16 16:48:55,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 16:48:55,371 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 16:48:55,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 16:48:55,372 INFO L229 MonitoredProcess]: Starting monitored process 9 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 16:48:55,373 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 (9)] Waiting until timeout for monitored process [2024-11-16 16:48:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 16:48:55,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-16 16:48:55,903 INFO L278 TraceCheckSpWp]: Computing forward predicates...