./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_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-10_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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 07:18:26,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 07:18:26,181 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 07:18:26,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 07:18:26,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 07:18:26,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 07:18:26,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 07:18:26,212 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 07:18:26,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 07:18:26,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 07:18:26,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 07:18:26,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 07:18:26,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 07:18:26,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 07:18:26,217 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 07:18:26,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 07:18:26,217 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 07:18:26,217 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 07:18:26,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 07:18:26,218 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 07:18:26,218 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 07:18:26,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 07:18:26,219 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 07:18:26,220 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 07:18:26,220 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 07:18:26,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 07:18:26,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 07:18:26,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:18:26,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 07:18:26,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 07:18:26,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 07:18:26,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 07:18:26,226 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-11-22 07:18:26,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 07:18:26,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 07:18:26,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 07:18:26,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 07:18:26,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 07:18:26,451 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-10_file-9.i [2024-11-22 07:18:27,709 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 07:18:27,903 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 07:18:27,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-22 07:18:27,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c36940d4/0c9eeae94faf439684652138a898435c/FLAG8f14c9bbf [2024-11-22 07:18:27,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c36940d4/0c9eeae94faf439684652138a898435c [2024-11-22 07:18:27,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 07:18:27,937 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 07:18:27,940 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 07:18:27,940 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 07:18:27,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 07:18:27,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:18:27" (1/1) ... [2024-11-22 07:18:27,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@603591c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:27, skipping insertion in model container [2024-11-22 07:18:27,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:18:27" (1/1) ... [2024-11-22 07:18:27,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 07:18:28,123 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-10_file-9.i[914,927] [2024-11-22 07:18:28,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:18:28,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 07:18:28,284 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-10_file-9.i[914,927] [2024-11-22 07:18:28,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:18:28,342 INFO L204 MainTranslator]: Completed translation [2024-11-22 07:18:28,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28 WrapperNode [2024-11-22 07:18:28,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 07:18:28,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 07:18:28,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 07:18:28,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 07:18:28,349 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:18:28" (1/1) ... [2024-11-22 07:18:28,361 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:18:28" (1/1) ... [2024-11-22 07:18:28,391 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 227 [2024-11-22 07:18:28,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 07:18:28,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 07:18:28,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 07:18:28,392 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 07:18:28,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,424 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:18:28,425 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,425 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,449 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 07:18:28,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 07:18:28,451 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 07:18:28,451 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 07:18:28,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (1/1) ... [2024-11-22 07:18:28,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:18:28,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:18:28,494 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:18:28,497 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:18:28,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 07:18:28,538 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 07:18:28,539 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 07:18:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 07:18:28,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 07:18:28,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 07:18:28,624 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 07:18:28,626 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 07:18:28,903 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 07:18:28,904 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 07:18:28,913 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 07:18:28,913 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 07:18:28,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:18:28 BoogieIcfgContainer [2024-11-22 07:18:28,914 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 07:18:28,916 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 07:18:28,916 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 07:18:28,919 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 07:18:28,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:18:27" (1/3) ... [2024-11-22 07:18:28,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c86e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:18:28, skipping insertion in model container [2024-11-22 07:18:28,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:18:28" (2/3) ... [2024-11-22 07:18:28,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52c86e5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:18:28, skipping insertion in model container [2024-11-22 07:18:28,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:18:28" (3/3) ... [2024-11-22 07:18:28,922 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-22 07:18:28,936 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 07:18:28,936 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 07:18:28,985 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 07:18:28,990 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;@7080ffb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 07:18:28,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 07:18:28,996 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:18:29,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 07:18:29,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:18:29,011 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:18:29,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:18:29,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:18:29,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1627320500, now seen corresponding path program 1 times [2024-11-22 07:18:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:18:29,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223656205] [2024-11-22 07:18:29,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:18:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-22 07:18:29,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:18:29,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223656205] [2024-11-22 07:18:29,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223656205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:18:29,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508427664] [2024-11-22 07:18:29,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:29,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:18:29,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:18:29,305 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:18:29,306 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:18:29,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:29,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 07:18:29,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:18:29,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-22 07:18:29,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:18:29,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508427664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:18:29,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:18:29,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 07:18:29,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250225921] [2024-11-22 07:18:29,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:18:29,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 07:18:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:18:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 07:18:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:18:29,499 INFO L87 Difference]: Start difference. First operand has 93 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 07:18:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:18:29,529 INFO L93 Difference]: Finished difference Result 179 states and 300 transitions. [2024-11-22 07:18:29,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 07:18:29,533 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-11-22 07:18:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:18:29,539 INFO L225 Difference]: With dead ends: 179 [2024-11-22 07:18:29,539 INFO L226 Difference]: Without dead ends: 89 [2024-11-22 07:18:29,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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:18:29,545 INFO L432 NwaCegarLoop]: 133 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, 133 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:18:29,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:18:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-22 07:18:29,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-22 07:18:29,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 61 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:18:29,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 133 transitions. [2024-11-22 07:18:29,611 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 133 transitions. Word has length 171 [2024-11-22 07:18:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:18:29,612 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 133 transitions. [2024-11-22 07:18:29,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 07:18:29,613 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 133 transitions. [2024-11-22 07:18:29,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-22 07:18:29,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:18:29,617 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:18:29,641 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:18:29,818 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:18:29,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:18:29,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:18:29,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1363168124, now seen corresponding path program 1 times [2024-11-22 07:18:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:18:29,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732699531] [2024-11-22 07:18:29,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:29,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:18:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:30,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:18:30,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:18:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732699531] [2024-11-22 07:18:30,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732699531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:18:30,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:18:30,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:18:30,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731453656] [2024-11-22 07:18:30,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:18:30,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:18:30,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:18:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:18:30,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:18:30,079 INFO L87 Difference]: Start difference. First operand 89 states and 133 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:18:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:18:30,107 INFO L93 Difference]: Finished difference Result 176 states and 265 transitions. [2024-11-22 07:18:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:18:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-22 07:18:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:18:30,109 INFO L225 Difference]: With dead ends: 176 [2024-11-22 07:18:30,109 INFO L226 Difference]: Without dead ends: 90 [2024-11-22 07:18:30,110 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:18:30,111 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 0 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 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:18:30,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:18:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-22 07:18:30,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-22 07:18:30,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:18:30,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-11-22 07:18:30,127 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 171 [2024-11-22 07:18:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:18:30,130 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-11-22 07:18:30,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:18:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-11-22 07:18:30,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:18:30,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:18:30,133 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:18:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 07:18:30,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:18:30,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:18:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1998716338, now seen corresponding path program 1 times [2024-11-22 07:18:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:18:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599662374] [2024-11-22 07:18:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:30,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:18:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:32,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:18:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:18:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599662374] [2024-11-22 07:18:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599662374] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:18:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704666713] [2024-11-22 07:18:32,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:32,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:18:32,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:18:32,778 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:18:32,779 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:18:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:32,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 07:18:32,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:18:33,451 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2024-11-22 07:18:33,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:18:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:18:42,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704666713] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:18:42,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:18:42,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2024-11-22 07:18:42,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056584207] [2024-11-22 07:18:42,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:18:42,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:18:42,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:18:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:18:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=367, Unknown=2, NotChecked=0, Total=462 [2024-11-22 07:18:42,572 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:18:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:18:56,416 INFO L93 Difference]: Finished difference Result 346 states and 509 transitions. [2024-11-22 07:18:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:18:56,417 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:18:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:18:56,422 INFO L225 Difference]: With dead ends: 346 [2024-11-22 07:18:56,422 INFO L226 Difference]: Without dead ends: 259 [2024-11-22 07:18:56,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=134, Invalid=511, Unknown=5, NotChecked=0, Total=650 [2024-11-22 07:18:56,426 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 396 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 07:18:56,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 641 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-22 07:18:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-22 07:18:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 185. [2024-11-22 07:18:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 151 states have (on average 1.4304635761589404) internal successors, (216), 152 states have internal predecessors, (216), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-22 07:18:56,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 278 transitions. [2024-11-22 07:18:56,451 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 278 transitions. Word has length 172 [2024-11-22 07:18:56,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:18:56,452 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 278 transitions. [2024-11-22 07:18:56,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:18:56,452 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 278 transitions. [2024-11-22 07:18:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:18:56,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:18:56,454 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:18:56,464 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:18:56,655 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:18:56,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:18:56,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:18:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -628596551, now seen corresponding path program 1 times [2024-11-22 07:18:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:18:56,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733177564] [2024-11-22 07:18:56,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:18:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:58,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:18:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:18:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733177564] [2024-11-22 07:18:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733177564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:18:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903272648] [2024-11-22 07:18:58,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:18:58,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:18:58,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:18:58,656 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:18:58,657 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:18:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:18:58,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 07:18:58,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:18:59,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 361 proven. 75 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-22 07:18:59,155 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:18:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:18:59,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903272648] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:18:59,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:18:59,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6, 6] total 19 [2024-11-22 07:18:59,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174502160] [2024-11-22 07:18:59,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:18:59,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 07:18:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:18:59,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 07:18:59,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-22 07:18:59,427 INFO L87 Difference]: Start difference. First operand 185 states and 278 transitions. Second operand has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) [2024-11-22 07:19:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:01,041 INFO L93 Difference]: Finished difference Result 475 states and 703 transitions. [2024-11-22 07:19:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 07:19:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) Word has length 172 [2024-11-22 07:19:01,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:01,046 INFO L225 Difference]: With dead ends: 475 [2024-11-22 07:19:01,046 INFO L226 Difference]: Without dead ends: 293 [2024-11-22 07:19:01,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=718, Unknown=0, NotChecked=0, Total=930 [2024-11-22 07:19:01,051 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 258 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:01,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 390 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 07:19:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-22 07:19:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 123. [2024-11-22 07:19:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 177 transitions. [2024-11-22 07:19:01,076 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 177 transitions. Word has length 172 [2024-11-22 07:19:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:01,077 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 177 transitions. [2024-11-22 07:19:01,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 7 states have call successors, (77), 3 states have call predecessors, (77), 5 states have return successors, (78), 6 states have call predecessors, (78), 7 states have call successors, (78) [2024-11-22 07:19:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 177 transitions. [2024-11-22 07:19:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:19:01,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:01,081 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:01,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 07:19:01,281 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:19:01,282 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:01,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1649664905, now seen corresponding path program 1 times [2024-11-22 07:19:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732487506] [2024-11-22 07:19:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732487506] [2024-11-22 07:19:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732487506] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87317877] [2024-11-22 07:19:03,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:03,289 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:19:03,290 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:19:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:03,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 07:19:03,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2024-11-22 07:19:03,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:19:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:04,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87317877] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:04,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:19:04,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 21 [2024-11-22 07:19:04,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666374283] [2024-11-22 07:19:04,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:04,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:19:04,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:04,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:19:04,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2024-11-22 07:19:04,638 INFO L87 Difference]: Start difference. First operand 123 states and 177 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:10,207 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:19:14,211 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:19:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:14,349 INFO L93 Difference]: Finished difference Result 397 states and 563 transitions. [2024-11-22 07:19:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:19:14,349 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:19:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:14,351 INFO L225 Difference]: With dead ends: 397 [2024-11-22 07:19:14,351 INFO L226 Difference]: Without dead ends: 277 [2024-11-22 07:19:14,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2024-11-22 07:19:14,353 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 349 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:14,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 578 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 270 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2024-11-22 07:19:14,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-22 07:19:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 124. [2024-11-22 07:19:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2024-11-22 07:19:14,366 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 172 [2024-11-22 07:19:14,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:14,366 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2024-11-22 07:19:14,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-22 07:19:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:19:14,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:14,368 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:14,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 07:19:14,569 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:19:14,569 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:14,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:14,570 INFO L85 PathProgramCache]: Analyzing trace with hash 607307216, now seen corresponding path program 1 times [2024-11-22 07:19:14,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:14,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245605694] [2024-11-22 07:19:14,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:14,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:16,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245605694] [2024-11-22 07:19:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245605694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366997656] [2024-11-22 07:19:16,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:16,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:16,365 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:19:16,366 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:19:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:16,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 07:19:16,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:16,685 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:19:16,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366997656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:16,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:19:16,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2024-11-22 07:19:16,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095461108] [2024-11-22 07:19:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:16,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:19:16,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:16,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:19:16,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 07:19:16,687 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:16,887 INFO L93 Difference]: Finished difference Result 315 states and 445 transitions. [2024-11-22 07:19:16,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 07:19:16,891 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:19:16,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:16,892 INFO L225 Difference]: With dead ends: 315 [2024-11-22 07:19:16,892 INFO L226 Difference]: Without dead ends: 194 [2024-11-22 07:19:16,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-22 07:19:16,894 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 107 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:16,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 603 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 07:19:16,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-22 07:19:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 124. [2024-11-22 07:19:16,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2024-11-22 07:19:16,905 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 172 [2024-11-22 07:19:16,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:16,905 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2024-11-22 07:19:16,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:16,906 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-22 07:19:16,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:19:16,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:16,910 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:16,919 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:19:17,113 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:19:17,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:17,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1576014512, now seen corresponding path program 1 times [2024-11-22 07:19:17,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:17,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695267433] [2024-11-22 07:19:17,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:17,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:18,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695267433] [2024-11-22 07:19:18,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695267433] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:18,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672748892] [2024-11-22 07:19:18,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:18,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:18,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:18,222 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:19:18,223 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:19:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:18,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 07:19:18,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:18,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2024-11-22 07:19:18,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:19:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:19,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672748892] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:19,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:19:19,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 22 [2024-11-22 07:19:19,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619561616] [2024-11-22 07:19:19,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:19,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:19:19,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:19,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:19:19,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2024-11-22 07:19:19,669 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:20,700 INFO L93 Difference]: Finished difference Result 380 states and 541 transitions. [2024-11-22 07:19:20,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:19:20,702 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:19:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:20,705 INFO L225 Difference]: With dead ends: 380 [2024-11-22 07:19:20,706 INFO L226 Difference]: Without dead ends: 259 [2024-11-22 07:19:20,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2024-11-22 07:19:20,707 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 275 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:20,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 814 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 07:19:20,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-22 07:19:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 125. [2024-11-22 07:19:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 95 states have (on average 1.3473684210526315) internal successors, (128), 95 states have internal predecessors, (128), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2024-11-22 07:19:20,718 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 172 [2024-11-22 07:19:20,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:20,718 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2024-11-22 07:19:20,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2024-11-22 07:19:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:19:20,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:20,720 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:20,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 07:19:20,920 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:19:20,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:20,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1226963079, now seen corresponding path program 1 times [2024-11-22 07:19:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:20,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420640] [2024-11-22 07:19:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:20,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420640] [2024-11-22 07:19:21,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:21,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381015199] [2024-11-22 07:19:21,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:21,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:21,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:21,901 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:19:21,902 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:19:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:22,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 07:19:22,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 673 proven. 39 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2024-11-22 07:19:22,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:19:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:22,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381015199] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:22,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:19:22,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12, 11] total 23 [2024-11-22 07:19:22,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114935437] [2024-11-22 07:19:22,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:22,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:19:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:19:22,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2024-11-22 07:19:22,955 INFO L87 Difference]: Start difference. First operand 125 states and 180 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:24,139 INFO L93 Difference]: Finished difference Result 387 states and 551 transitions. [2024-11-22 07:19:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:19:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:19:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:24,141 INFO L225 Difference]: With dead ends: 387 [2024-11-22 07:19:24,141 INFO L226 Difference]: Without dead ends: 265 [2024-11-22 07:19:24,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=553, Unknown=0, NotChecked=0, Total=702 [2024-11-22 07:19:24,142 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 244 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:24,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 837 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 07:19:24,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-22 07:19:24,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 124. [2024-11-22 07:19:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:24,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2024-11-22 07:19:24,151 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 172 [2024-11-22 07:19:24,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:24,151 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2024-11-22 07:19:24,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:24,152 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-22 07:19:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-22 07:19:24,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:24,154 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:24,162 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:19:24,354 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:19:24,355 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1030009042, now seen corresponding path program 1 times [2024-11-22 07:19:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652328240] [2024-11-22 07:19:24,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:24,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 33 proven. 42 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:24,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652328240] [2024-11-22 07:19:24,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652328240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:19:24,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296930707] [2024-11-22 07:19:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:24,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:24,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:24,942 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:19:24,943 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:19:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:25,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 07:19:25,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:25,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:19:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296930707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:25,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:19:25,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 11 [2024-11-22 07:19:25,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686651483] [2024-11-22 07:19:25,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:25,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:19:25,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:25,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:19:25,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:19:25,242 INFO L87 Difference]: Start difference. First operand 124 states and 178 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:25,522 INFO L93 Difference]: Finished difference Result 301 states and 428 transitions. [2024-11-22 07:19:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 07:19:25,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-22 07:19:25,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:25,525 INFO L225 Difference]: With dead ends: 301 [2024-11-22 07:19:25,525 INFO L226 Difference]: Without dead ends: 180 [2024-11-22 07:19:25,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 172 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-22 07:19:25,526 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 91 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:25,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 713 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 07:19:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-22 07:19:25,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 100. [2024-11-22 07:19:25,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 141 transitions. [2024-11-22 07:19:25,535 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 141 transitions. Word has length 172 [2024-11-22 07:19:25,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:25,536 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 141 transitions. [2024-11-22 07:19:25,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 141 transitions. [2024-11-22 07:19:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 07:19:25,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:25,538 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:25,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-22 07:19:25,740 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:19:25,741 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:25,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:25,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1464472855, now seen corresponding path program 1 times [2024-11-22 07:19:25,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:25,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890579135] [2024-11-22 07:19:25,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:25,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:25,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:25,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890579135] [2024-11-22 07:19:25,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890579135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:19:25,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:19:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561728097] [2024-11-22 07:19:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:19:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:19:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:19:25,790 INFO L87 Difference]: Start difference. First operand 100 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:25,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:25,828 INFO L93 Difference]: Finished difference Result 289 states and 410 transitions. [2024-11-22 07:19:25,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:19:25,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-22 07:19:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:25,830 INFO L225 Difference]: With dead ends: 289 [2024-11-22 07:19:25,830 INFO L226 Difference]: Without dead ends: 192 [2024-11-22 07:19:25,831 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:19:25,831 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 113 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:25,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 236 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:19:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-22 07:19:25,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 126. [2024-11-22 07:19:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2024-11-22 07:19:25,844 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 174 [2024-11-22 07:19:25,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:25,845 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2024-11-22 07:19:25,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2024-11-22 07:19:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 07:19:25,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:25,847 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:25,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 07:19:25,847 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:25,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:25,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1162707575, now seen corresponding path program 1 times [2024-11-22 07:19:25,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:25,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818540596] [2024-11-22 07:19:25,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:25,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818540596] [2024-11-22 07:19:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818540596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:26,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:19:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 07:19:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698097072] [2024-11-22 07:19:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 07:19:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 07:19:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 07:19:26,301 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:26,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:26,792 INFO L93 Difference]: Finished difference Result 474 states and 653 transitions. [2024-11-22 07:19:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:19:26,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-22 07:19:26,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:26,795 INFO L225 Difference]: With dead ends: 474 [2024-11-22 07:19:26,795 INFO L226 Difference]: Without dead ends: 351 [2024-11-22 07:19:26,795 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:19:26,796 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 190 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:26,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 891 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 07:19:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-22 07:19:26,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 270. [2024-11-22 07:19:26,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 222 states have (on average 1.3288288288288288) internal successors, (295), 224 states have internal predecessors, (295), 39 states have call successors, (39), 8 states have call predecessors, (39), 8 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-22 07:19:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 373 transitions. [2024-11-22 07:19:26,825 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 373 transitions. Word has length 174 [2024-11-22 07:19:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:26,825 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 373 transitions. [2024-11-22 07:19:26,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 373 transitions. [2024-11-22 07:19:26,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 07:19:26,827 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:26,827 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:26,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 07:19:26,827 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:26,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:26,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1033494830, now seen corresponding path program 1 times [2024-11-22 07:19:26,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:26,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278578589] [2024-11-22 07:19:26,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:26,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:19:26,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1105908456] [2024-11-22 07:19:26,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:26,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:26,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:26,899 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:19:26,900 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:19:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:26,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 07:19:26,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:27,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 369 proven. 63 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2024-11-22 07:19:27,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:19:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 12 proven. 63 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-22 07:19:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278578589] [2024-11-22 07:19:27,403 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 07:19:27,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105908456] [2024-11-22 07:19:27,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105908456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:19:27,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 07:19:27,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 07:19:27,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235947743] [2024-11-22 07:19:27,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 07:19:27,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 07:19:27,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:27,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 07:19:27,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-22 07:19:27,405 INFO L87 Difference]: Start difference. First operand 270 states and 373 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-11-22 07:19:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:28,073 INFO L93 Difference]: Finished difference Result 680 states and 905 transitions. [2024-11-22 07:19:28,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 07:19:28,074 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 174 [2024-11-22 07:19:28,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:28,077 INFO L225 Difference]: With dead ends: 680 [2024-11-22 07:19:28,078 INFO L226 Difference]: Without dead ends: 413 [2024-11-22 07:19:28,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 332 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:19:28,079 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 285 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:28,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 750 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 07:19:28,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-22 07:19:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 258. [2024-11-22 07:19:28,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 212 states have (on average 1.3160377358490567) internal successors, (279), 213 states have internal predecessors, (279), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-22 07:19:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 353 transitions. [2024-11-22 07:19:28,099 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 353 transitions. Word has length 174 [2024-11-22 07:19:28,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:28,099 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 353 transitions. [2024-11-22 07:19:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2024-11-22 07:19:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 353 transitions. [2024-11-22 07:19:28,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-22 07:19:28,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:28,101 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:28,109 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:19:28,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:28,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -740005749, now seen corresponding path program 1 times [2024-11-22 07:19:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364591901] [2024-11-22 07:19:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:28,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364591901] [2024-11-22 07:19:28,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364591901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:28,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:19:28,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 07:19:28,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347017839] [2024-11-22 07:19:28,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:28,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:19:28,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:28,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:19:28,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:19:28,581 INFO L87 Difference]: Start difference. First operand 258 states and 353 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:29,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:29,012 INFO L93 Difference]: Finished difference Result 752 states and 1009 transitions. [2024-11-22 07:19:29,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 07:19:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-22 07:19:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:29,016 INFO L225 Difference]: With dead ends: 752 [2024-11-22 07:19:29,016 INFO L226 Difference]: Without dead ends: 497 [2024-11-22 07:19:29,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 07:19:29,017 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 170 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:29,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 574 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 07:19:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-22 07:19:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 265. [2024-11-22 07:19:29,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 219 states have (on average 1.3196347031963471) internal successors, (289), 220 states have internal predecessors, (289), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-22 07:19:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 363 transitions. [2024-11-22 07:19:29,037 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 363 transitions. Word has length 174 [2024-11-22 07:19:29,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:29,037 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 363 transitions. [2024-11-22 07:19:29,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:29,038 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 363 transitions. [2024-11-22 07:19:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 07:19:29,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:29,039 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:29,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 07:19:29,039 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:29,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2143999383, now seen corresponding path program 1 times [2024-11-22 07:19:29,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:29,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460146383] [2024-11-22 07:19:29,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:29,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-22 07:19:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:19:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460146383] [2024-11-22 07:19:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460146383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:29,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:19:29,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 07:19:29,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184824721] [2024-11-22 07:19:29,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:29,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:19:29,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:19:29,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:19:29,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:19:29,296 INFO L87 Difference]: Start difference. First operand 265 states and 363 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:29,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:29,619 INFO L93 Difference]: Finished difference Result 697 states and 939 transitions. [2024-11-22 07:19:29,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:19:29,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-22 07:19:29,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:29,622 INFO L225 Difference]: With dead ends: 697 [2024-11-22 07:19:29,622 INFO L226 Difference]: Without dead ends: 435 [2024-11-22 07:19:29,623 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:19:29,623 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 77 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:19:29,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 770 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 07:19:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-22 07:19:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 290. [2024-11-22 07:19:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 244 states have (on average 1.319672131147541) internal successors, (322), 245 states have internal predecessors, (322), 37 states have call successors, (37), 8 states have call predecessors, (37), 8 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-22 07:19:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 396 transitions. [2024-11-22 07:19:29,648 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 396 transitions. Word has length 175 [2024-11-22 07:19:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:29,648 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 396 transitions. [2024-11-22 07:19:29,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-22 07:19:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 396 transitions. [2024-11-22 07:19:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-22 07:19:29,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:29,650 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 07:19:29,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:29,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash -734992903, now seen corresponding path program 1 times [2024-11-22 07:19:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:19:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368548608] [2024-11-22 07:19:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:19:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:19:29,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923697949] [2024-11-22 07:19:29,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:29,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:19:29,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:29,716 INFO L229 MonitoredProcess]: Starting monitored process 11 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:19:29,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 07:19:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 07:19:29,817 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 07:19:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 07:19:29,965 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 07:19:29,965 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 07:19:29,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 07:19:29,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-22 07:19:30,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 07:19:30,171 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:19:30,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 07:19:30,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:19:30 BoogieIcfgContainer [2024-11-22 07:19:30,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 07:19:30,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 07:19:30,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 07:19:30,264 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 07:19:30,264 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:18:28" (3/4) ... [2024-11-22 07:19:30,266 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 07:19:30,267 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 07:19:30,268 INFO L158 Benchmark]: Toolchain (without parser) took 62331.50ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 112.4MB in the beginning and 277.6MB in the end (delta: -165.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 07:19:30,268 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 07:19:30,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.79ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 136.4MB in the end (delta: -24.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 07:19:30,268 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.85ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 07:19:30,268 INFO L158 Benchmark]: Boogie Preprocessor took 58.19ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 07:19:30,269 INFO L158 Benchmark]: RCFGBuilder took 463.60ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 104.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 07:19:30,269 INFO L158 Benchmark]: TraceAbstraction took 61347.72ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 103.8MB in the beginning and 278.7MB in the end (delta: -174.9MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. [2024-11-22 07:19:30,269 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 327.2MB. Free memory is still 277.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 07:19:30,270 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.11ms. Allocated memory is still 96.5MB. Free memory is still 50.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.79ms. Allocated memory is still 167.8MB. Free memory was 112.0MB in the beginning and 136.4MB in the end (delta: -24.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.85ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 133.1MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.19ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 128.9MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 463.60ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 104.7MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 61347.72ms. Allocated memory was 167.8MB in the beginning and 327.2MB in the end (delta: 159.4MB). Free memory was 103.8MB in the beginning and 278.7MB in the end (delta: -174.9MB). Peak memory consumption was 165.4MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 327.2MB. Free memory is still 277.6MB. 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 158, overapproximation of shiftLeft at line 158. 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 = 99999999.01; [L44] float var_1_27 = 999999999.5; [L45] unsigned char var_1_28 = 2; [L46] unsigned char var_1_29 = 0; [L47] signed char var_1_30 = 5; [L48] signed char var_1_31 = 25; [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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L153] last_1_var_1_10 = var_1_10 [L154] last_1_var_1_12 = var_1_12 [L155] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L111] var_1_3 = __VERIFIER_nondet_short() [L112] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L112] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L113] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L113] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, 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] [L114] var_1_5 = __VERIFIER_nondet_long() [L115] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L117] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] var_1_6 = __VERIFIER_nondet_char() [L119] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L119] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L120] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] var_1_7 = __VERIFIER_nondet_char() [L122] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L122] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L123] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L124] var_1_8 = __VERIFIER_nondet_double() [L125] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L125] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0, var_1_9=9/5] [L126] var_1_9 = __VERIFIER_nondet_double() [L127] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L127] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L128] var_1_11 = __VERIFIER_nondet_uchar() [L129] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L129] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L130] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L130] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L131] var_1_15 = __VERIFIER_nondet_uchar() [L132] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L132] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L133] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L133] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L134] var_1_20 = __VERIFIER_nondet_uchar() [L135] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L135] 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=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L136] 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=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L136] 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=-255, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L137] var_1_21 = __VERIFIER_nondet_uchar() [L138] 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=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L138] 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=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L139] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L139] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L140] var_1_22 = __VERIFIER_nondet_ulong() [L141] 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=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L141] 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=-255, var_1_21=-255, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L142] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L142] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=2, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L143] var_1_24 = __VERIFIER_nondet_uchar() [L144] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L144] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L145] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L145] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_26=9999999901/100, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L146] var_1_26 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L147] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=25, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L148] var_1_31 = __VERIFIER_nondet_char() [L149] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L149] 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L150] CALL assume_abort_if_not(var_1_31 <= 126) 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L150] RET assume_abort_if_not(var_1_31 <= 126) 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=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L166] RET updateVariables() [L167] CALL step() [L55] COND TRUE var_1_20 || var_1_21 [L56] var_1_19 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=64, var_1_24=0, var_1_25=511/4, var_1_27=1999999999/2, var_1_28=2, var_1_29=0, var_1_30=5, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_26 [L60] var_1_27 = var_1_26 [L61] var_1_28 = 16 [L62] var_1_29 = 0 [L63] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L64] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L65] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L67] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L68] COND TRUE var_1_6 <= stepLocal_2 [L69] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L73] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L73] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L80] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L82] var_1_18 = var_1_3 [L83] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L84] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L85] COND FALSE !((- var_1_9) <= var_1_8) [L98] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L100] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L101] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L101] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L102] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L167] RET step() [L168] CALL, EXPR property() [L158] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] [L158-L159] 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)) ; [L168] RET, EXPR property() [L168] 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, 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=0, var_1_1=11/2, var_1_20=-255, var_1_21=-255, var_1_22=0, var_1_23=0, var_1_24=0, var_1_25=2, var_1_26=2, var_1_27=2, var_1_28=16, var_1_29=0, var_1_30=-127, var_1_31=-127, var_1_3=0, var_1_5=2, var_1_6=6, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.2s, OverallIterations: 15, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2561 SdHoareTripleChecker+Valid, 15.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2555 mSDsluCounter, 8189 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6081 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3992 IncrementalHoareTripleChecker+Invalid, 4135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 2108 mSDtfsCounter, 3992 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2760 GetRequests, 2557 SyntacticMatches, 4 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 27.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=14, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 1501 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 4316 NumberOfCodeBlocks, 4316 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4798 ConstructedInterpolants, 30 QuantifiedInterpolants, 18164 SizeOfPredicates, 75 NumberOfNonLiveVariables, 3735 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 35624/36400 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:19:30,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-10_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 afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 07:19:32,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 07:19:32,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 07:19:32,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 07:19:32,204 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 07:19:32,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 07:19:32,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 07:19:32,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 07:19:32,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 07:19:32,234 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 07:19:32,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 07:19:32,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 07:19:32,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 07:19:32,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 07:19:32,237 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 07:19:32,238 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 07:19:32,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 07:19:32,239 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 07:19:32,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 07:19:32,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 07:19:32,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 07:19:32,242 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 07:19:32,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 07:19:32,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 07:19:32,243 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 07:19:32,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 07:19:32,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 07:19:32,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 07:19:32,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 07:19:32,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:19:32,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 07:19:32,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 07:19:32,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 07:19:32,245 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 07:19:32,245 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 07:19:32,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 07:19:32,249 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 07:19:32,249 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 07:19:32,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 07:19:32,249 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 -> afbe11d6255891eb62142fb858f033cde06ed708dce6d7f48966c5c7a69497ae [2024-11-22 07:19:32,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 07:19:32,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 07:19:32,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 07:19:32,566 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 07:19:32,566 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 07:19:32,567 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-10_file-9.i [2024-11-22 07:19:33,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 07:19:34,147 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 07:19:34,147 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-22 07:19:34,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b6110b/b90aa12c05f2450fb28ac810dcd733d9/FLAGf95a5f212 [2024-11-22 07:19:34,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e9b6110b/b90aa12c05f2450fb28ac810dcd733d9 [2024-11-22 07:19:34,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 07:19:34,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 07:19:34,531 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 07:19:34,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 07:19:34,537 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 07:19:34,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34, skipping insertion in model container [2024-11-22 07:19:34,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 07:19:34,692 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-10_file-9.i[914,927] [2024-11-22 07:19:34,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:19:34,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 07:19:34,786 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-10_file-9.i[914,927] [2024-11-22 07:19:34,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:19:34,834 INFO L204 MainTranslator]: Completed translation [2024-11-22 07:19:34,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34 WrapperNode [2024-11-22 07:19:34,835 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 07:19:34,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 07:19:34,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 07:19:34,836 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 07:19:34,842 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:19:34" (1/1) ... [2024-11-22 07:19:34,856 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:19:34" (1/1) ... [2024-11-22 07:19:34,888 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-22 07:19:34,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 07:19:34,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 07:19:34,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 07:19:34,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 07:19:34,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,904 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,924 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:19:34,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,934 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,939 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 07:19:34,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 07:19:34,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 07:19:34,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 07:19:34,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (1/1) ... [2024-11-22 07:19:34,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:19:34,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:19:34,980 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:19:34,982 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:19:35,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 07:19:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 07:19:35,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 07:19:35,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 07:19:35,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 07:19:35,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 07:19:35,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 07:19:35,124 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 07:19:35,514 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-22 07:19:35,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 07:19:35,529 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 07:19:35,529 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 07:19:35,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:19:35 BoogieIcfgContainer [2024-11-22 07:19:35,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 07:19:35,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 07:19:35,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 07:19:35,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 07:19:35,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:19:34" (1/3) ... [2024-11-22 07:19:35,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a8132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:19:35, skipping insertion in model container [2024-11-22 07:19:35,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:19:34" (2/3) ... [2024-11-22 07:19:35,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a8132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:19:35, skipping insertion in model container [2024-11-22 07:19:35,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:19:35" (3/3) ... [2024-11-22 07:19:35,536 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-9.i [2024-11-22 07:19:35,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 07:19:35,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 07:19:35,598 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 07:19:35,604 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;@55ea9126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 07:19:35,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 07:19:35,609 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-22 07:19:35,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:35,621 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:35,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:35,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 278698665, now seen corresponding path program 1 times [2024-11-22 07:19:35,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 07:19:35,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339820083] [2024-11-22 07:19:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:35,642 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:19:35,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 07:19:35,643 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:19:35,644 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:19:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:35,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 07:19:35,880 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:19:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-22 07:19:35,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:19:35,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 07:19:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339820083] [2024-11-22 07:19:35,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339820083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:19:35,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:19:35,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 07:19:35,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115250341] [2024-11-22 07:19:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:19:35,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 07:19:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 07:19:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 07:19:35,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:19:35,953 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 07:19:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:19:35,979 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-22 07:19:35,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 07:19:35,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-22 07:19:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:19:35,990 INFO L225 Difference]: With dead ends: 141 [2024-11-22 07:19:35,990 INFO L226 Difference]: Without dead ends: 70 [2024-11-22 07:19:35,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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:19:35,999 INFO L432 NwaCegarLoop]: 105 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, 105 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:19:36,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:19:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-22 07:19:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-22 07:19:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-22 07:19:36,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-22 07:19:36,036 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 163 [2024-11-22 07:19:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:19:36,036 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-22 07:19:36,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-22 07:19:36,037 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-22 07:19:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-22 07:19:36,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:19:36,040 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 07:19:36,049 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:19:36,241 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:19:36,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:19:36,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:19:36,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2045374101, now seen corresponding path program 1 times [2024-11-22 07:19:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 07:19:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218556692] [2024-11-22 07:19:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:19:36,245 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:19:36,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 07:19:36,247 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:19:36,248 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:19:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:19:36,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 07:19:36,498 INFO L278 TraceCheckSpWp]: Computing forward predicates...