./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 07:39:22,965 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 07:39:23,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 07:39:23,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 07:39:23,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 07:39:23,030 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 07:39:23,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 07:39:23,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 07:39:23,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 07:39:23,031 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 07:39:23,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 07:39:23,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 07:39:23,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 07:39:23,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 07:39:23,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 07:39:23,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 07:39:23,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 07:39:23,033 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 07:39:23,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 07:39:23,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 07:39:23,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 07:39:23,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 07:39:23,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 07:39:23,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 07:39:23,037 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 07:39:23,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 07:39:23,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 07:39:23,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 07:39:23,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 07:39:23,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 07:39:23,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 07:39:23,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 07:39:23,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:39:23,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 07:39:23,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 07:39:23,039 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 07:39:23,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 07:39:23,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 07:39:23,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 07:39:23,040 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 07:39:23,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 07:39:23,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 07:39:23,041 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-22 07:39:23,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 07:39:23,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 07:39:23,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 07:39:23,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 07:39:23,297 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 07:39:23,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:39:24,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 07:39:24,708 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 07:39:24,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:39:24,717 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffffdc83c/9d56a52b4af94ef7b788f4d34a99e5f0/FLAG5cfcae5fe [2024-11-22 07:39:25,073 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffffdc83c/9d56a52b4af94ef7b788f4d34a99e5f0 [2024-11-22 07:39:25,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 07:39:25,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 07:39:25,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 07:39:25,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 07:39:25,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 07:39:25,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c07773 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25, skipping insertion in model container [2024-11-22 07:39:25,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 07:39:25,241 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-22 07:39:25,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:39:25,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 07:39:25,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-22 07:39:25,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:39:25,357 INFO L204 MainTranslator]: Completed translation [2024-11-22 07:39:25,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25 WrapperNode [2024-11-22 07:39:25,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 07:39:25,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 07:39:25,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 07:39:25,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 07:39:25,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,402 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-22 07:39:25,402 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 07:39:25,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 07:39:25,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 07:39:25,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 07:39:25,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,416 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,433 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-22 07:39:25,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 07:39:25,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 07:39:25,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 07:39:25,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 07:39:25,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (1/1) ... [2024-11-22 07:39:25,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:39:25,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:39:25,495 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-22 07:39:25,507 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-22 07:39:25,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 07:39:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 07:39:25,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 07:39:25,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 07:39:25,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 07:39:25,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 07:39:25,605 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 07:39:25,606 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 07:39:25,952 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-22 07:39:25,952 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 07:39:25,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 07:39:25,967 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 07:39:25,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:39:25 BoogieIcfgContainer [2024-11-22 07:39:25,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 07:39:25,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 07:39:25,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 07:39:25,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 07:39:25,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:39:25" (1/3) ... [2024-11-22 07:39:25,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efa0ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:39:25, skipping insertion in model container [2024-11-22 07:39:25,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:39:25" (2/3) ... [2024-11-22 07:39:25,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7efa0ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:39:25, skipping insertion in model container [2024-11-22 07:39:25,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:39:25" (3/3) ... [2024-11-22 07:39:25,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:39:25,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 07:39:25,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 07:39:26,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 07:39:26,038 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;@30ce3451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 07:39:26,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 07:39:26,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:39:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-22 07:39:26,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:39:26,054 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:39:26,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:39:26,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:39:26,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1782693715, now seen corresponding path program 1 times [2024-11-22 07:39:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:39:26,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147805830] [2024-11-22 07:39:26,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:39:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2024-11-22 07:39:26,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:39:26,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147805830] [2024-11-22 07:39:26,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147805830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:39:26,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386102162] [2024-11-22 07:39:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:26,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:39:26,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:39:26,418 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-22 07:39:26,422 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-22 07:39:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:26,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 07:39:26,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:39:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2024-11-22 07:39:26,635 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:39:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386102162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:39:26,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:39:26,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 07:39:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632837140] [2024-11-22 07:39:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:39:26,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 07:39:26,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:39:26,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 07:39:26,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:39:26,665 INFO L87 Difference]: Start difference. First operand has 109 states, 78 states have (on average 1.435897435897436) internal successors, (112), 79 states have internal predecessors, (112), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-22 07:39:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:39:26,697 INFO L93 Difference]: Finished difference Result 211 states and 358 transitions. [2024-11-22 07:39:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 07:39:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-22 07:39:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:39:26,705 INFO L225 Difference]: With dead ends: 211 [2024-11-22 07:39:26,705 INFO L226 Difference]: Without dead ends: 105 [2024-11-22 07:39:26,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 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-22 07:39:26,710 INFO L432 NwaCegarLoop]: 161 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, 161 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-22 07:39:26,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:39:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-22 07:39:26,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-22 07:39:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:39:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 161 transitions. [2024-11-22 07:39:26,745 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 161 transitions. Word has length 186 [2024-11-22 07:39:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:39:26,746 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 161 transitions. [2024-11-22 07:39:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-22 07:39:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 161 transitions. [2024-11-22 07:39:26,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-22 07:39:26,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:39:26,749 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:39:26,757 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-22 07:39:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 07:39:26,954 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:39:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:39:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 551637579, now seen corresponding path program 1 times [2024-11-22 07:39:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:39:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365570773] [2024-11-22 07:39:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:39:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:27,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:39:27,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:39:27,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365570773] [2024-11-22 07:39:27,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365570773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:39:27,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:39:27,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:39:27,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401680662] [2024-11-22 07:39:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:39:27,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:39:27,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:39:27,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:39:27,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:39:27,226 INFO L87 Difference]: Start difference. First operand 105 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:39:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:39:27,253 INFO L93 Difference]: Finished difference Result 208 states and 321 transitions. [2024-11-22 07:39:27,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:39:27,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-22 07:39:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:39:27,255 INFO L225 Difference]: With dead ends: 208 [2024-11-22 07:39:27,255 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 07:39:27,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 07:39:27,261 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:39:27,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:39:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 07:39:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-22 07:39:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:39:27,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 162 transitions. [2024-11-22 07:39:27,276 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 162 transitions. Word has length 186 [2024-11-22 07:39:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:39:27,278 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 162 transitions. [2024-11-22 07:39:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:39:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 162 transitions. [2024-11-22 07:39:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:39:27,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:39:27,282 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:39:27,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 07:39:27,283 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:39:27,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:39:27,283 INFO L85 PathProgramCache]: Analyzing trace with hash -16239608, now seen corresponding path program 1 times [2024-11-22 07:39:27,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:39:27,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83450169] [2024-11-22 07:39:27,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:27,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:39:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:39:30,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:39:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83450169] [2024-11-22 07:39:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83450169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:39:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984621076] [2024-11-22 07:39:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:30,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:39:30,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:39:30,372 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-22 07:39:30,374 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-22 07:39:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:30,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 07:39:30,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:39:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 395 proven. 81 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2024-11-22 07:39:30,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:39:31,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:39:31,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984621076] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:39:31,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:39:31,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2024-11-22 07:39:31,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767395036] [2024-11-22 07:39:31,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:39:31,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 07:39:31,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:39:31,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 07:39:31,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2024-11-22 07:39:31,217 INFO L87 Difference]: Start difference. First operand 106 states and 162 transitions. Second operand has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) [2024-11-22 07:39:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:39:32,588 INFO L93 Difference]: Finished difference Result 291 states and 435 transitions. [2024-11-22 07:39:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 07:39:32,590 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) Word has length 187 [2024-11-22 07:39:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:39:32,592 INFO L225 Difference]: With dead ends: 291 [2024-11-22 07:39:32,592 INFO L226 Difference]: Without dead ends: 188 [2024-11-22 07:39:32,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2024-11-22 07:39:32,594 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 1012 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 07:39:32,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 597 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 07:39:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-22 07:39:32,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 110. [2024-11-22 07:39:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:39:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2024-11-22 07:39:32,611 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 187 [2024-11-22 07:39:32,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:39:32,612 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2024-11-22 07:39:32,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.7368421052631575) internal successors, (128), 19 states have internal predecessors, (128), 7 states have call successors, (83), 3 states have call predecessors, (83), 5 states have return successors, (84), 6 states have call predecessors, (84), 7 states have call successors, (84) [2024-11-22 07:39:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2024-11-22 07:39:32,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:39:32,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:39:32,615 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:39:32,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 07:39:32,815 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,SelfDestructingSolverStorable2 [2024-11-22 07:39:32,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:39:32,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:39:32,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1037307962, now seen corresponding path program 1 times [2024-11-22 07:39:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:39:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815358685] [2024-11-22 07:39:32,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:39:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:39:34,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:39:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815358685] [2024-11-22 07:39:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815358685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:39:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91515157] [2024-11-22 07:39:34,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:34,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:39:34,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:39:34,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:39:34,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 07:39:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:34,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 07:39:34,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:39:34,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 07:39:34,516 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:39:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:39:43,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91515157] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:39:43,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:39:43,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2024-11-22 07:39:43,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39185382] [2024-11-22 07:39:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:39:43,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:39:43,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:39:43,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:39:43,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=364, Unknown=2, NotChecked=0, Total=462 [2024-11-22 07:39:43,607 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:39:48,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-22 07:39:53,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:39:53,893 INFO L93 Difference]: Finished difference Result 391 states and 568 transitions. [2024-11-22 07:39:53,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:39:53,897 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-22 07:39:53,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:39:53,899 INFO L225 Difference]: With dead ends: 391 [2024-11-22 07:39:53,900 INFO L226 Difference]: Without dead ends: 284 [2024-11-22 07:39:53,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=137, Invalid=510, Unknown=3, NotChecked=0, Total=650 [2024-11-22 07:39:53,901 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 371 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-22 07:39:53,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 711 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 237 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-22 07:39:53,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-22 07:39:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 208. [2024-11-22 07:39:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 170 states have (on average 1.411764705882353) internal successors, (240), 171 states have internal predecessors, (240), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 07:39:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 306 transitions. [2024-11-22 07:39:53,925 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 306 transitions. Word has length 187 [2024-11-22 07:39:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:39:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 306 transitions. [2024-11-22 07:39:53,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:39:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 306 transitions. [2024-11-22 07:39:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:39:53,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:39:53,930 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:39:53,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 07:39:54,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:39:54,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:39:54,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:39:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1386359395, now seen corresponding path program 1 times [2024-11-22 07:39:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:39:54,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785313925] [2024-11-22 07:39:54,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:39:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:55,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:39:55,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:39:55,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785313925] [2024-11-22 07:39:55,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785313925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:39:55,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831966131] [2024-11-22 07:39:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:39:55,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:39:55,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:39:55,385 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:39:55,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 07:39:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:39:55,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 07:39:55,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:39:55,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 07:39:55,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:08,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831966131] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:40:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 21 [2024-11-22 07:40:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816816421] [2024-11-22 07:40:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:08,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:40:08,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:40:08,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=328, Unknown=3, NotChecked=0, Total=420 [2024-11-22 07:40:08,691 INFO L87 Difference]: Start difference. First operand 208 states and 306 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:17,134 INFO L93 Difference]: Finished difference Result 537 states and 768 transitions. [2024-11-22 07:40:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:40:17,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-22 07:40:17,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:17,137 INFO L225 Difference]: With dead ends: 537 [2024-11-22 07:40:17,137 INFO L226 Difference]: Without dead ends: 332 [2024-11-22 07:40:17,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 365 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=131, Invalid=465, Unknown=4, NotChecked=0, Total=600 [2024-11-22 07:40:17,139 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 314 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:17,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 886 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 07:40:17,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-22 07:40:17,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 210. [2024-11-22 07:40:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 172 states have (on average 1.4127906976744187) internal successors, (243), 173 states have internal predecessors, (243), 33 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-22 07:40:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 309 transitions. [2024-11-22 07:40:17,157 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 309 transitions. Word has length 187 [2024-11-22 07:40:17,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:17,157 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 309 transitions. [2024-11-22 07:40:17,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 309 transitions. [2024-11-22 07:40:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:40:17,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:17,159 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:17,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 07:40:17,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:17,360 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:17,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:17,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1568715592, now seen corresponding path program 1 times [2024-11-22 07:40:17,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:17,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391118151] [2024-11-22 07:40:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:40:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391118151] [2024-11-22 07:40:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391118151] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486930708] [2024-11-22 07:40:19,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:19,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:19,177 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:40:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 07:40:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:19,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 07:40:19,287 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:20,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 591 proven. 171 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2024-11-22 07:40:20,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 180 refuted. 0 times theorem prover too weak. 1278 trivial. 0 not checked. [2024-11-22 07:40:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486930708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:40:21,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:40:21,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 34 [2024-11-22 07:40:21,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848133] [2024-11-22 07:40:21,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:40:21,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 07:40:21,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:21,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 07:40:21,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=920, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 07:40:21,114 INFO L87 Difference]: Start difference. First operand 210 states and 309 transitions. Second operand has 34 states, 33 states have (on average 4.515151515151516) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (84), 5 states have call predecessors, (84), 10 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) [2024-11-22 07:40:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:25,364 INFO L93 Difference]: Finished difference Result 677 states and 966 transitions. [2024-11-22 07:40:25,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-22 07:40:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 4.515151515151516) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (84), 5 states have call predecessors, (84), 10 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) Word has length 187 [2024-11-22 07:40:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:25,367 INFO L225 Difference]: With dead ends: 677 [2024-11-22 07:40:25,367 INFO L226 Difference]: Without dead ends: 470 [2024-11-22 07:40:25,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1500 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1009, Invalid=4103, Unknown=0, NotChecked=0, Total=5112 [2024-11-22 07:40:25,370 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1712 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:25,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 1447 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 07:40:25,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-22 07:40:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 353. [2024-11-22 07:40:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 275 states have (on average 1.3672727272727272) internal successors, (376), 277 states have internal predecessors, (376), 66 states have call successors, (66), 11 states have call predecessors, (66), 11 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 07:40:25,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 508 transitions. [2024-11-22 07:40:25,414 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 508 transitions. Word has length 187 [2024-11-22 07:40:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 508 transitions. [2024-11-22 07:40:25,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.515151515151516) internal successors, (149), 32 states have internal predecessors, (149), 9 states have call successors, (84), 5 states have call predecessors, (84), 10 states have return successors, (84), 9 states have call predecessors, (84), 9 states have call successors, (84) [2024-11-22 07:40:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 508 transitions. [2024-11-22 07:40:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:40:25,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:25,416 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:25,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 07:40:25,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:25,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:25,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:25,623 INFO L85 PathProgramCache]: Analyzing trace with hash -614606136, now seen corresponding path program 1 times [2024-11-22 07:40:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:25,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554691443] [2024-11-22 07:40:25,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:25,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:40:26,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554691443] [2024-11-22 07:40:26,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554691443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:26,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323607952] [2024-11-22 07:40:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:26,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:26,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:26,289 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:40:26,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 07:40:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:26,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 07:40:26,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 07:40:26,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323607952] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:40:27,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2024-11-22 07:40:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822401665] [2024-11-22 07:40:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:40:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:27,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:40:27,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-22 07:40:27,580 INFO L87 Difference]: Start difference. First operand 353 states and 508 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:28,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:28,518 INFO L93 Difference]: Finished difference Result 823 states and 1173 transitions. [2024-11-22 07:40:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:40:28,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-22 07:40:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:28,525 INFO L225 Difference]: With dead ends: 823 [2024-11-22 07:40:28,525 INFO L226 Difference]: Without dead ends: 473 [2024-11-22 07:40:28,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2024-11-22 07:40:28,527 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 286 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:28,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 959 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 07:40:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-22 07:40:28,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 377. [2024-11-22 07:40:28,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 299 states have (on average 1.374581939799331) internal successors, (411), 301 states have internal predecessors, (411), 66 states have call successors, (66), 11 states have call predecessors, (66), 11 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 07:40:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 543 transitions. [2024-11-22 07:40:28,560 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 543 transitions. Word has length 187 [2024-11-22 07:40:28,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:28,560 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 543 transitions. [2024-11-22 07:40:28,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:28,561 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 543 transitions. [2024-11-22 07:40:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-22 07:40:28,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:28,562 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:28,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-22 07:40:28,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:28,765 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:28,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:28,765 INFO L85 PathProgramCache]: Analyzing trace with hash -963657569, now seen corresponding path program 1 times [2024-11-22 07:40:28,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:28,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362785330] [2024-11-22 07:40:28,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:28,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 33 proven. 48 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:40:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362785330] [2024-11-22 07:40:29,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362785330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:29,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592579447] [2024-11-22 07:40:29,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:29,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:29,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:29,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:40:29,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 07:40:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:29,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 07:40:29,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:29,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 771 proven. 45 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2024-11-22 07:40:29,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592579447] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:40:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 11] total 20 [2024-11-22 07:40:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625358600] [2024-11-22 07:40:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:40:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:40:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-22 07:40:30,409 INFO L87 Difference]: Start difference. First operand 377 states and 543 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:31,338 INFO L93 Difference]: Finished difference Result 854 states and 1217 transitions. [2024-11-22 07:40:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:40:31,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-22 07:40:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:31,346 INFO L225 Difference]: With dead ends: 854 [2024-11-22 07:40:31,346 INFO L226 Difference]: Without dead ends: 480 [2024-11-22 07:40:31,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-11-22 07:40:31,349 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 252 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:31,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 890 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 07:40:31,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-22 07:40:31,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 401. [2024-11-22 07:40:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 323 states have (on average 1.3808049535603715) internal successors, (446), 325 states have internal predecessors, (446), 66 states have call successors, (66), 11 states have call predecessors, (66), 11 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-22 07:40:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 578 transitions. [2024-11-22 07:40:31,387 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 578 transitions. Word has length 187 [2024-11-22 07:40:31,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:31,388 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 578 transitions. [2024-11-22 07:40:31,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 578 transitions. [2024-11-22 07:40:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-22 07:40:31,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:31,392 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:31,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 07:40:31,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:31,593 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:31,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -968990175, now seen corresponding path program 1 times [2024-11-22 07:40:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:31,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393220659] [2024-11-22 07:40:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:40:31,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1203923554] [2024-11-22 07:40:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:31,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:31,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:31,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:40:31,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 07:40:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:31,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 07:40:31,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:31,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-22 07:40:31,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:32,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 12 proven. 69 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-22 07:40:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393220659] [2024-11-22 07:40:32,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 07:40:32,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203923554] [2024-11-22 07:40:32,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203923554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:40:32,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:40:32,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 07:40:32,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40809075] [2024-11-22 07:40:32,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 07:40:32,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 07:40:32,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:32,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 07:40:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-22 07:40:32,094 INFO L87 Difference]: Start difference. First operand 401 states and 578 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-22 07:40:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:32,799 INFO L93 Difference]: Finished difference Result 1041 states and 1441 transitions. [2024-11-22 07:40:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 07:40:32,800 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) Word has length 189 [2024-11-22 07:40:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:32,802 INFO L225 Difference]: With dead ends: 1041 [2024-11-22 07:40:32,803 INFO L226 Difference]: Without dead ends: 643 [2024-11-22 07:40:32,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-22 07:40:32,804 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 217 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:32,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 900 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 07:40:32,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-22 07:40:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 426. [2024-11-22 07:40:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 352 states have (on average 1.3607954545454546) internal successors, (479), 354 states have internal predecessors, (479), 60 states have call successors, (60), 13 states have call predecessors, (60), 13 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-22 07:40:32,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 599 transitions. [2024-11-22 07:40:32,832 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 599 transitions. Word has length 189 [2024-11-22 07:40:32,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:32,833 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 599 transitions. [2024-11-22 07:40:32,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 3 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 3 states have call predecessors, (52), 3 states have call successors, (52) [2024-11-22 07:40:32,834 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 599 transitions. [2024-11-22 07:40:32,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-22 07:40:32,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:32,836 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:32,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 07:40:33,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-22 07:40:33,037 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:33,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:33,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1399968200, now seen corresponding path program 1 times [2024-11-22 07:40:33,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:33,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465358943] [2024-11-22 07:40:33,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:33,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465358943] [2024-11-22 07:40:33,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465358943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:33,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:33,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:40:33,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437944433] [2024-11-22 07:40:33,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:33,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:40:33,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:33,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:40:33,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:40:33,100 INFO L87 Difference]: Start difference. First operand 426 states and 599 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:33,159 INFO L93 Difference]: Finished difference Result 1030 states and 1447 transitions. [2024-11-22 07:40:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:40:33,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-22 07:40:33,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:33,163 INFO L225 Difference]: With dead ends: 1030 [2024-11-22 07:40:33,163 INFO L226 Difference]: Without dead ends: 607 [2024-11-22 07:40:33,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 07:40:33,164 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 141 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:33,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 310 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:40:33,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-22 07:40:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 563. [2024-11-22 07:40:33,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 422 states have (on average 1.2962085308056872) internal successors, (547), 426 states have internal predecessors, (547), 116 states have call successors, (116), 24 states have call predecessors, (116), 24 states have return successors, (116), 112 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-22 07:40:33,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 779 transitions. [2024-11-22 07:40:33,215 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 779 transitions. Word has length 189 [2024-11-22 07:40:33,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:33,215 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 779 transitions. [2024-11-22 07:40:33,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 779 transitions. [2024-11-22 07:40:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-22 07:40:33,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:33,217 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:33,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 07:40:33,217 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:33,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1098202920, now seen corresponding path program 1 times [2024-11-22 07:40:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:33,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583791587] [2024-11-22 07:40:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:33,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583791587] [2024-11-22 07:40:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583791587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 07:40:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37380298] [2024-11-22 07:40:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:40:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:40:33,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 07:40:33,631 INFO L87 Difference]: Start difference. First operand 563 states and 779 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:34,129 INFO L93 Difference]: Finished difference Result 1785 states and 2369 transitions. [2024-11-22 07:40:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:40:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-22 07:40:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:34,134 INFO L225 Difference]: With dead ends: 1785 [2024-11-22 07:40:34,135 INFO L226 Difference]: Without dead ends: 1237 [2024-11-22 07:40:34,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-11-22 07:40:34,136 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 172 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:34,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 984 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 07:40:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-22 07:40:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 825. [2024-11-22 07:40:34,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 632 states have (on average 1.2784810126582278) internal successors, (808), 640 states have internal predecessors, (808), 151 states have call successors, (151), 41 states have call predecessors, (151), 41 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-22 07:40:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1110 transitions. [2024-11-22 07:40:34,209 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1110 transitions. Word has length 189 [2024-11-22 07:40:34,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:34,210 INFO L471 AbstractCegarLoop]: Abstraction has 825 states and 1110 transitions. [2024-11-22 07:40:34,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:34,211 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1110 transitions. [2024-11-22 07:40:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 07:40:34,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:34,212 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 07:40:34,212 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:34,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash 29296591, now seen corresponding path program 1 times [2024-11-22 07:40:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115150129] [2024-11-22 07:40:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:35,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:35,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115150129] [2024-11-22 07:40:35,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115150129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:35,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:35,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 07:40:35,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342539733] [2024-11-22 07:40:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:35,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 07:40:35,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:35,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 07:40:35,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-22 07:40:35,625 INFO L87 Difference]: Start difference. First operand 825 states and 1110 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:37,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:37,696 INFO L93 Difference]: Finished difference Result 1832 states and 2485 transitions. [2024-11-22 07:40:37,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 07:40:37,697 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-22 07:40:37,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:37,702 INFO L225 Difference]: With dead ends: 1832 [2024-11-22 07:40:37,702 INFO L226 Difference]: Without dead ends: 1052 [2024-11-22 07:40:37,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-22 07:40:37,705 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 265 mSDsluCounter, 1792 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 2041 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:37,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 2041 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 07:40:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-11-22 07:40:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 933. [2024-11-22 07:40:37,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 740 states have (on average 1.2945945945945947) internal successors, (958), 748 states have internal predecessors, (958), 151 states have call successors, (151), 41 states have call predecessors, (151), 41 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-22 07:40:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1260 transitions. [2024-11-22 07:40:37,789 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1260 transitions. Word has length 190 [2024-11-22 07:40:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:37,790 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1260 transitions. [2024-11-22 07:40:37,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 12 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1260 transitions. [2024-11-22 07:40:37,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 07:40:37,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:37,793 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 07:40:37,793 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 331061871, now seen corresponding path program 1 times [2024-11-22 07:40:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263409986] [2024-11-22 07:40:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:38,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263409986] [2024-11-22 07:40:38,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263409986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:38,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:38,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 07:40:38,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443389692] [2024-11-22 07:40:38,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:38,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:40:38,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:38,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:40:38,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 07:40:38,415 INFO L87 Difference]: Start difference. First operand 933 states and 1260 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:39,226 INFO L93 Difference]: Finished difference Result 2175 states and 2943 transitions. [2024-11-22 07:40:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:40:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-22 07:40:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:39,231 INFO L225 Difference]: With dead ends: 2175 [2024-11-22 07:40:39,231 INFO L226 Difference]: Without dead ends: 1287 [2024-11-22 07:40:39,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-22 07:40:39,234 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 360 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:39,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1350 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 07:40:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-22 07:40:39,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 945. [2024-11-22 07:40:39,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 752 states have (on average 1.2898936170212767) internal successors, (970), 760 states have internal predecessors, (970), 151 states have call successors, (151), 41 states have call predecessors, (151), 41 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-22 07:40:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1272 transitions. [2024-11-22 07:40:39,315 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1272 transitions. Word has length 190 [2024-11-22 07:40:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:39,316 INFO L471 AbstractCegarLoop]: Abstraction has 945 states and 1272 transitions. [2024-11-22 07:40:39,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1272 transitions. [2024-11-22 07:40:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 07:40:39,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:39,317 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:39,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 07:40:39,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash -144355016, now seen corresponding path program 1 times [2024-11-22 07:40:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443126534] [2024-11-22 07:40:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-22 07:40:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:40:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443126534] [2024-11-22 07:40:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443126534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:39,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:39,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 07:40:39,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55123473] [2024-11-22 07:40:39,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:39,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:40:39,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:40:39,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:40:39,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:40:39,611 INFO L87 Difference]: Start difference. First operand 945 states and 1272 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:40,025 INFO L93 Difference]: Finished difference Result 2241 states and 2969 transitions. [2024-11-22 07:40:40,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:40:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-22 07:40:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:40,032 INFO L225 Difference]: With dead ends: 2241 [2024-11-22 07:40:40,032 INFO L226 Difference]: Without dead ends: 1341 [2024-11-22 07:40:40,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:40:40,035 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 76 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:40:40,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 934 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 07:40:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-22 07:40:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 975. [2024-11-22 07:40:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 782 states have (on average 1.2915601023017902) internal successors, (1010), 790 states have internal predecessors, (1010), 151 states have call successors, (151), 41 states have call predecessors, (151), 41 states have return successors, (151), 143 states have call predecessors, (151), 151 states have call successors, (151) [2024-11-22 07:40:40,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1312 transitions. [2024-11-22 07:40:40,128 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1312 transitions. Word has length 190 [2024-11-22 07:40:40,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:40,128 INFO L471 AbstractCegarLoop]: Abstraction has 975 states and 1312 transitions. [2024-11-22 07:40:40,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-22 07:40:40,128 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1312 transitions. [2024-11-22 07:40:40,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-22 07:40:40,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:40,129 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:40,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 07:40:40,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:40,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:40,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1264651464, now seen corresponding path program 1 times [2024-11-22 07:40:40,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:40:40,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625105104] [2024-11-22 07:40:40,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:40,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:40:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:40:40,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525690573] [2024-11-22 07:40:40,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:40,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:40:40,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:40,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:40:40,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 07:40:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 07:40:40,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 07:40:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 07:40:40,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 07:40:40,445 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 07:40:40,446 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 07:40:40,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 07:40:40,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 07:40:40,650 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:40,737 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 07:40:40,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:40:40 BoogieIcfgContainer [2024-11-22 07:40:40,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 07:40:40,740 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 07:40:40,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 07:40:40,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 07:40:40,740 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:39:25" (3/4) ... [2024-11-22 07:40:40,742 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 07:40:40,743 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 07:40:40,743 INFO L158 Benchmark]: Toolchain (without parser) took 75667.14ms. Allocated memory was 192.9MB in the beginning and 427.8MB in the end (delta: 234.9MB). Free memory was 159.3MB in the beginning and 166.2MB in the end (delta: -6.9MB). Peak memory consumption was 228.6MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,743 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 07:40:40,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.02ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 142.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.43ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 139.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,744 INFO L158 Benchmark]: Boogie Preprocessor took 50.23ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 134.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,744 INFO L158 Benchmark]: RCFGBuilder took 513.82ms. Allocated memory is still 192.9MB. Free memory was 134.9MB in the beginning and 106.9MB in the end (delta: 28.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,744 INFO L158 Benchmark]: TraceAbstraction took 74770.49ms. Allocated memory was 192.9MB in the beginning and 427.8MB in the end (delta: 234.9MB). Free memory was 106.2MB in the beginning and 167.3MB in the end (delta: -61.1MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. [2024-11-22 07:40:40,745 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 427.8MB. Free memory was 167.3MB in the beginning and 166.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 07:40:40,746 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.18ms. Allocated memory is still 192.9MB. Free memory is still 161.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.02ms. Allocated memory is still 192.9MB. Free memory was 159.3MB in the beginning and 142.5MB in the end (delta: 16.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.43ms. Allocated memory is still 192.9MB. Free memory was 142.5MB in the beginning and 139.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.23ms. Allocated memory is still 192.9MB. Free memory was 139.1MB in the beginning and 134.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 513.82ms. Allocated memory is still 192.9MB. Free memory was 134.9MB in the beginning and 106.9MB in the end (delta: 28.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 74770.49ms. Allocated memory was 192.9MB in the beginning and 427.8MB in the end (delta: 234.9MB). Free memory was 106.2MB in the beginning and 167.3MB in the end (delta: -61.1MB). Peak memory consumption was 176.2MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 427.8MB. Free memory was 167.3MB in the beginning and 166.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of shiftLeft at line 170, overapproximation of someUnaryDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_20 = 0; [L38] unsigned char var_1_21 = 0; [L39] unsigned long int var_1_22 = 0; [L40] unsigned char var_1_23 = 64; [L41] unsigned char var_1_24 = 2; [L42] double var_1_25 = 127.75; [L43] double var_1_26 = 9999999999999.2; [L44] double var_1_27 = 9.1; [L45] signed long int var_1_28 = -64; [L46] unsigned char var_1_29 = 8; [L47] unsigned char var_1_30 = 10; [L48] unsigned char var_1_31 = 0; [L49] unsigned char last_1_var_1_10 = 32; [L50] unsigned short int last_1_var_1_12 = 16; [L51] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L165] last_1_var_1_10 = var_1_10 [L166] last_1_var_1_12 = var_1_12 [L167] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L120] var_1_3 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L122] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L123] var_1_5 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L124] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L125] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L126] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L127] var_1_6 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L128] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L129] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L130] var_1_7 = __VERIFIER_nondet_char() [L131] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L131] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L132] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L133] var_1_8 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L134] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0, var_1_9=9/5] [L135] var_1_9 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L136] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L139] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L142] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L143] var_1_20 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L144] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L145] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L146] var_1_21 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_21 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L148] RET assume_abort_if_not(var_1_21 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L149] var_1_22 = __VERIFIER_nondet_ulong() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L151] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L152] var_1_24 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L153] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L154] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_27=91/10, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L155] var_1_27 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L156] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=10, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L157] var_1_30 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L159] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L160] var_1_31 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L161] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L162] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L178] RET updateVariables() [L179] CALL step() [L55] COND FALSE !(var_1_20 || var_1_21) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=64, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=511/4, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L59] COND TRUE var_1_23 > var_1_19 [L60] var_1_25 = ((((999999.5) < 0 ) ? -(999999.5) : (999999.5))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L62] COND FALSE !(var_1_22 < ((((var_1_24) < 0 ) ? -(var_1_24) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-64, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L67] var_1_28 = -256 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=8, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_28 != -32 [L69] var_1_29 = (var_1_30 + var_1_31) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L73] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L74] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L76] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L77] COND TRUE var_1_6 <= stepLocal_2 [L78] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L82] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L89] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L91] var_1_18 = var_1_3 [L92] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L93] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L94] COND FALSE !((- var_1_9) <= var_1_8) [L107] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L109] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L110] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L111] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=254, stepLocal_4=254, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L170-L171] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=254, var_1_11=254, var_1_12=6, var_1_13=6, var_1_15=1, var_1_16=254, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_20=0, var_1_21=0, var_1_22=51, var_1_23=51, var_1_24=51, var_1_25=2, var_1_26=49999999999996/5, var_1_28=-256, var_1_29=0, var_1_30=0, var_1_31=0, var_1_3=0, var_1_5=256, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.6s, OverallIterations: 15, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 31.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5190 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5178 mSDsluCounter, 12485 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9964 mSDsCounter, 611 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6252 IncrementalHoareTripleChecker+Invalid, 6864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 611 mSolverCounterUnsat, 2521 mSDtfsCounter, 6252 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3028 GetRequests, 2766 SyntacticMatches, 2 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2206 ImplicationChecksByTransitivity, 41.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=975occurred in iteration=14, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 2068 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 4508 NumberOfCodeBlocks, 4508 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 5222 ConstructedInterpolants, 30 QuantifiedInterpolants, 20270 SizeOfPredicates, 62 NumberOfNonLiveVariables, 3469 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 28 InterpolantComputations, 11 PerfectInterpolantSequences, 41163/42336 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-22 07:40:40,860 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.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 e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 07:40:42,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 07:40:42,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 07:40:42,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 07:40:42,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 07:40:42,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 07:40:42,738 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 07:40:42,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 07:40:42,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 07:40:42,739 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 07:40:42,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 07:40:42,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 07:40:42,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 07:40:42,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 07:40:42,741 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 07:40:42,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 07:40:42,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 07:40:42,742 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 07:40:42,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 07:40:42,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 07:40:42,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 07:40:42,746 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 07:40:42,747 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 07:40:42,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:40:42,748 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 07:40:42,748 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 07:40:42,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 07:40:42,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 07:40:42,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 07:40:42,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 07:40:42,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 07:40:42,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 07:40:42,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 07:40:42,751 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 -> e27a7e8208feb4e2a429aaf18357ed884e258fb84f6f2f7be613f0f94968064e [2024-11-22 07:40:43,035 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 07:40:43,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 07:40:43,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 07:40:43,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 07:40:43,067 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 07:40:43,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:40:44,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 07:40:44,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 07:40:44,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:40:44,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9314984/a21ead23034d40eba8fa18db52612600/FLAG8f91e26d2 [2024-11-22 07:40:45,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9314984/a21ead23034d40eba8fa18db52612600 [2024-11-22 07:40:45,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 07:40:45,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 07:40:45,072 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 07:40:45,072 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 07:40:45,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 07:40:45,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6960d8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45, skipping insertion in model container [2024-11-22 07:40:45,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 07:40:45,258 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-22 07:40:45,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:40:45,326 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 07:40:45,338 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-9.i[914,927] [2024-11-22 07:40:45,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:40:45,394 INFO L204 MainTranslator]: Completed translation [2024-11-22 07:40:45,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45 WrapperNode [2024-11-22 07:40:45,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 07:40:45,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 07:40:45,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 07:40:45,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 07:40:45,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,411 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,434 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-22 07:40:45,435 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 07:40:45,436 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 07:40:45,436 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 07:40:45,436 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 07:40:45,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,453 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,469 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-22 07:40:45,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,493 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 07:40:45,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 07:40:45,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 07:40:45,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 07:40:45,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (1/1) ... [2024-11-22 07:40:45,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:40:45,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:40:45,530 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-22 07:40:45,535 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-22 07:40:45,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 07:40:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 07:40:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 07:40:45,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 07:40:45,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 07:40:45,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 07:40:45,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 07:40:45,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 07:40:46,063 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 07:40:46,063 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 07:40:46,080 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 07:40:46,081 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 07:40:46,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:40:46 BoogieIcfgContainer [2024-11-22 07:40:46,082 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 07:40:46,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 07:40:46,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 07:40:46,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 07:40:46,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:40:45" (1/3) ... [2024-11-22 07:40:46,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b51ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:40:46, skipping insertion in model container [2024-11-22 07:40:46,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:40:45" (2/3) ... [2024-11-22 07:40:46,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b51ecba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:40:46, skipping insertion in model container [2024-11-22 07:40:46,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:40:46" (3/3) ... [2024-11-22 07:40:46,089 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-9.i [2024-11-22 07:40:46,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 07:40:46,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 07:40:46,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 07:40:46,172 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;@6ad67cf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 07:40:46,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 07:40:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:40:46,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-22 07:40:46,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:46,188 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:46,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1692540324, now seen corresponding path program 1 times [2024-11-22 07:40:46,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 07:40:46,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768699314] [2024-11-22 07:40:46,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:46,207 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-22 07:40:46,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 07:40:46,210 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-22 07:40:46,211 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-22 07:40:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:46,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 07:40:46,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-22 07:40:46,543 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:40:46,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 07:40:46,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768699314] [2024-11-22 07:40:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768699314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:40:46,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:40:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 07:40:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868650348] [2024-11-22 07:40:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:40:46,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 07:40:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 07:40:46,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 07:40:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:40:46,574 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.392156862745098) internal successors, (71), 52 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-22 07:40:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:40:46,604 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-11-22 07:40:46,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 07:40:46,606 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-11-22 07:40:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:40:46,612 INFO L225 Difference]: With dead ends: 157 [2024-11-22 07:40:46,613 INFO L226 Difference]: Without dead ends: 78 [2024-11-22 07:40:46,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-22 07:40:46,621 INFO L432 NwaCegarLoop]: 119 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, 119 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-22 07:40:46,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:40:46,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-22 07:40:46,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-22 07:40:46,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-22 07:40:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-11-22 07:40:46,670 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 178 [2024-11-22 07:40:46,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:40:46,671 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-11-22 07:40:46,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-22 07:40:46,672 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-11-22 07:40:46,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-22 07:40:46,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:40:46,676 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:40:46,685 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-22 07:40:46,876 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-22 07:40:46,877 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:40:46,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:40:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1469662952, now seen corresponding path program 1 times [2024-11-22 07:40:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 07:40:46,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766655444] [2024-11-22 07:40:46,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:46,879 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-22 07:40:46,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 07:40:46,881 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-22 07:40:46,885 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-22 07:40:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:40:47,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 07:40:47,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:40:48,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 501 proven. 126 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-11-22 07:40:48,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:40:49,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 07:40:49,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766655444] [2024-11-22 07:40:49,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766655444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:40:49,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2083852783] [2024-11-22 07:40:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:40:49,570 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 07:40:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 07:40:49,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 07:40:49,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process