./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.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 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:24,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:24,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:13:24,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:24,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:25,021 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:25,022 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:25,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:25,023 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:25,025 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:25,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:25,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:25,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:25,028 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:25,029 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:25,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:25,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:25,030 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:25,030 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:13:25,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:25,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:25,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:25,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:25,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:25,034 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:25,034 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:25,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:25,035 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:25,035 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:25,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:25,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:25,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:25,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:25,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:25,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:25,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:25,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:13:25,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:13:25,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:25,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:25,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:25,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:25,040 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 -> 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 [2024-11-09 02:13:25,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:25,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:25,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:25,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:25,322 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:25,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:13:26,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:26,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:26,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:13:27,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44246159/3125849db5e348cbb28da426039cd948/FLAGde134362b [2024-11-09 02:13:27,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f44246159/3125849db5e348cbb28da426039cd948 [2024-11-09 02:13:27,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:27,027 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:27,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:27,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:27,035 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:27,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56544ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27, skipping insertion in model container [2024-11-09 02:13:27,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,071 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:27,273 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_variablewrapping_wrapper-sp_file-46.i[917,930] [2024-11-09 02:13:27,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:27,373 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:27,387 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_variablewrapping_wrapper-sp_file-46.i[917,930] [2024-11-09 02:13:27,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:27,469 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:27,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27 WrapperNode [2024-11-09 02:13:27,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:27,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:27,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:27,471 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:27,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,494 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,536 INFO L138 Inliner]: procedures = 30, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2024-11-09 02:13:27,537 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:27,538 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:27,538 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:27,538 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:27,550 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,576 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:13:27,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:27,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:27,619 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:27,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:27,620 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (1/1) ... [2024-11-09 02:13:27,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:27,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:27,666 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-09 02:13:27,668 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-09 02:13:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:13:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:13:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:13:27,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:13:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:13:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:13:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:27,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:27,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:13:27,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:27,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:27,815 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:27,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:13:28,440 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-09 02:13:28,440 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:13:28,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:13:28,459 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:13:28,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:28 BoogieIcfgContainer [2024-11-09 02:13:28,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:13:28,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:13:28,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:13:28,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:13:28,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:27" (1/3) ... [2024-11-09 02:13:28,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62567e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:28, skipping insertion in model container [2024-11-09 02:13:28,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:27" (2/3) ... [2024-11-09 02:13:28,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62567e04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:13:28, skipping insertion in model container [2024-11-09 02:13:28,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:28" (3/3) ... [2024-11-09 02:13:28,471 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:13:28,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:13:28,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:13:28,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:13:28,560 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;@11bead9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:13:28,561 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:13:28,566 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:13:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:28,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:28,582 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:28,583 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:28,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:28,589 INFO L85 PathProgramCache]: Analyzing trace with hash 591901101, now seen corresponding path program 1 times [2024-11-09 02:13:28,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:28,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359480386] [2024-11-09 02:13:28,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:28,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359480386] [2024-11-09 02:13:33,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359480386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:33,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:33,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:13:33,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978576490] [2024-11-09 02:13:33,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:33,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:13:33,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:13:33,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:13:33,593 INFO L87 Difference]: Start difference. First operand has 101 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 85 states have internal predecessors, (119), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:13:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:34,657 INFO L93 Difference]: Finished difference Result 302 states and 477 transitions. [2024-11-09 02:13:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:13:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 116 [2024-11-09 02:13:34,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:34,673 INFO L225 Difference]: With dead ends: 302 [2024-11-09 02:13:34,673 INFO L226 Difference]: Without dead ends: 204 [2024-11-09 02:13:34,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:13:34,680 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 257 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:34,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 523 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:13:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-09 02:13:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 160. [2024-11-09 02:13:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.3515625) internal successors, (173), 128 states have internal predecessors, (173), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:13:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2024-11-09 02:13:34,784 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 116 [2024-11-09 02:13:34,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:34,787 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2024-11-09 02:13:34,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 12 states have internal predecessors, (49), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:13:34,788 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2024-11-09 02:13:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:34,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:34,791 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:34,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:13:34,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 5095087, now seen corresponding path program 1 times [2024-11-09 02:13:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:34,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550035173] [2024-11-09 02:13:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:35,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:35,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:35,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:35,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:35,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550035173] [2024-11-09 02:13:35,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550035173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:35,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:35,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 02:13:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353247822] [2024-11-09 02:13:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:35,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 02:13:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:35,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 02:13:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:13:35,417 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:35,711 INFO L93 Difference]: Finished difference Result 309 states and 444 transitions. [2024-11-09 02:13:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:35,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 02:13:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:35,714 INFO L225 Difference]: With dead ends: 309 [2024-11-09 02:13:35,714 INFO L226 Difference]: Without dead ends: 215 [2024-11-09 02:13:35,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:13:35,716 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 159 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:35,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 491 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:13:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-09 02:13:35,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 180. [2024-11-09 02:13:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:13:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 257 transitions. [2024-11-09 02:13:35,762 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 257 transitions. Word has length 116 [2024-11-09 02:13:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:35,762 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 257 transitions. [2024-11-09 02:13:35,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 257 transitions. [2024-11-09 02:13:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:35,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:35,765 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:35,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:13:35,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:35,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1014602927, now seen corresponding path program 1 times [2024-11-09 02:13:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:35,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467586714] [2024-11-09 02:13:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467586714] [2024-11-09 02:13:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467586714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:13:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923429889] [2024-11-09 02:13:38,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:38,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:13:38,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:13:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:13:38,610 INFO L87 Difference]: Start difference. First operand 180 states and 257 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 02:13:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:40,288 INFO L93 Difference]: Finished difference Result 575 states and 823 transitions. [2024-11-09 02:13:40,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:13:40,289 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 116 [2024-11-09 02:13:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:40,292 INFO L225 Difference]: With dead ends: 575 [2024-11-09 02:13:40,292 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 02:13:40,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2024-11-09 02:13:40,295 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 462 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:40,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 893 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:13:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 02:13:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 366. [2024-11-09 02:13:40,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 317 states have (on average 1.38801261829653) internal successors, (440), 318 states have internal predecessors, (440), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 526 transitions. [2024-11-09 02:13:40,367 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 526 transitions. Word has length 116 [2024-11-09 02:13:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:40,368 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 526 transitions. [2024-11-09 02:13:40,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 5 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-09 02:13:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 526 transitions. [2024-11-09 02:13:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:13:40,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:40,371 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:40,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:13:40,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:40,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash -265260751, now seen corresponding path program 1 times [2024-11-09 02:13:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416911669] [2024-11-09 02:13:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:41,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:41,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416911669] [2024-11-09 02:13:41,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416911669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:41,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:13:41,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297632680] [2024-11-09 02:13:41,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:41,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:13:41,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:41,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:13:41,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:13:41,013 INFO L87 Difference]: Start difference. First operand 366 states and 526 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:41,353 INFO L93 Difference]: Finished difference Result 577 states and 831 transitions. [2024-11-09 02:13:41,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:13:41,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2024-11-09 02:13:41,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:41,357 INFO L225 Difference]: With dead ends: 577 [2024-11-09 02:13:41,358 INFO L226 Difference]: Without dead ends: 471 [2024-11-09 02:13:41,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:13:41,362 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 217 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:41,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 475 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:13:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-09 02:13:41,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 366. [2024-11-09 02:13:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 317 states have (on average 1.38801261829653) internal successors, (440), 318 states have internal predecessors, (440), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:41,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 526 transitions. [2024-11-09 02:13:41,408 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 526 transitions. Word has length 116 [2024-11-09 02:13:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:41,409 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 526 transitions. [2024-11-09 02:13:41,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:41,409 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 526 transitions. [2024-11-09 02:13:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:41,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:41,413 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:41,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:13:41,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:41,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -224241624, now seen corresponding path program 1 times [2024-11-09 02:13:41,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:41,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238975361] [2024-11-09 02:13:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:41,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:41,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238975361] [2024-11-09 02:13:41,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238975361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:41,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:41,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510613424] [2024-11-09 02:13:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:41,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:41,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:41,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:41,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:41,625 INFO L87 Difference]: Start difference. First operand 366 states and 526 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:41,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:41,680 INFO L93 Difference]: Finished difference Result 663 states and 955 transitions. [2024-11-09 02:13:41,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:41,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 02:13:41,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:41,684 INFO L225 Difference]: With dead ends: 663 [2024-11-09 02:13:41,684 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 02:13:41,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:41,687 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:41,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 531 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:13:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 02:13:41,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-11-09 02:13:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 326 states have (on average 1.3773006134969326) internal successors, (449), 327 states have internal predecessors, (449), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:41,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 535 transitions. [2024-11-09 02:13:41,726 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 535 transitions. Word has length 118 [2024-11-09 02:13:41,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:41,727 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 535 transitions. [2024-11-09 02:13:41,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:41,728 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 535 transitions. [2024-11-09 02:13:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:41,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:41,730 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:41,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:13:41,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:41,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash 168785386, now seen corresponding path program 1 times [2024-11-09 02:13:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105457718] [2024-11-09 02:13:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:41,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:41,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105457718] [2024-11-09 02:13:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105457718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:41,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:13:41,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929769905] [2024-11-09 02:13:41,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:41,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:13:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:41,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:13:41,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:13:41,862 INFO L87 Difference]: Start difference. First operand 375 states and 535 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:42,076 INFO L93 Difference]: Finished difference Result 713 states and 1018 transitions. [2024-11-09 02:13:42,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:13:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-11-09 02:13:42,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:42,079 INFO L225 Difference]: With dead ends: 713 [2024-11-09 02:13:42,079 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 02:13:42,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:13:42,082 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 49 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:42,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 392 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:13:42,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 02:13:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 391. [2024-11-09 02:13:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 342 states have (on average 1.3771929824561404) internal successors, (471), 343 states have internal predecessors, (471), 43 states have call successors, (43), 5 states have call predecessors, (43), 5 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:42,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 557 transitions. [2024-11-09 02:13:42,122 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 557 transitions. Word has length 118 [2024-11-09 02:13:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:42,122 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 557 transitions. [2024-11-09 02:13:42,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:13:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 557 transitions. [2024-11-09 02:13:42,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:42,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:42,124 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:42,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:13:42,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:42,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash -872597158, now seen corresponding path program 1 times [2024-11-09 02:13:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:42,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937588073] [2024-11-09 02:13:42,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:42,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 02:13:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1257339154] [2024-11-09 02:13:42,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:42,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:13:42,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:42,245 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-09 02:13:42,246 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-09 02:13:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:42,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 02:13:42,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:13:42,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:42,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:42,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 39 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 17 [2024-11-09 02:13:42,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-09 02:13:43,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2024-11-09 02:13:43,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-09 02:13:43,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-09 02:13:44,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-09 02:13:44,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-09 02:13:44,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2024-11-09 02:13:45,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:45,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:13:45,009 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 02:13:45,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 41 [2024-11-09 02:13:45,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 02:13:45,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 40 [2024-11-09 02:13:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2024-11-09 02:13:45,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:13:45,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:45,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937588073] [2024-11-09 02:13:45,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 02:13:45,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257339154] [2024-11-09 02:13:45,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257339154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:13:45,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:13:45,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-09 02:13:45,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154839405] [2024-11-09 02:13:45,850 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 02:13:45,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:13:45,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:45,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:13:45,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=306, Unknown=6, NotChecked=0, Total=380 [2024-11-09 02:13:45,851 INFO L87 Difference]: Start difference. First operand 391 states and 557 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:13:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:47,060 INFO L93 Difference]: Finished difference Result 763 states and 1092 transitions. [2024-11-09 02:13:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 02:13:47,061 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-11-09 02:13:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:47,064 INFO L225 Difference]: With dead ends: 763 [2024-11-09 02:13:47,064 INFO L226 Difference]: Without dead ends: 450 [2024-11-09 02:13:47,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=393, Unknown=6, NotChecked=0, Total=506 [2024-11-09 02:13:47,067 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 49 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 6 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:47,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 550 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 755 Invalid, 26 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:13:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-11-09 02:13:47,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 415. [2024-11-09 02:13:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 365 states have (on average 1.3726027397260274) internal successors, (501), 366 states have internal predecessors, (501), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 587 transitions. [2024-11-09 02:13:47,114 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 587 transitions. Word has length 118 [2024-11-09 02:13:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:47,115 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 587 transitions. [2024-11-09 02:13:47,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 02:13:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 587 transitions. [2024-11-09 02:13:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:47,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:47,117 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:47,136 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-09 02:13:47,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:13:47,318 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:47,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2142506460, now seen corresponding path program 1 times [2024-11-09 02:13:47,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:47,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058134017] [2024-11-09 02:13:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:13:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-09 02:13:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-09 02:13:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 02:13:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:13:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 02:13:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 02:13:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:50,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:13:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 02:13:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 02:13:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:13:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:13:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 02:13:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 02:13:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:13:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:13:51,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:13:51,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058134017] [2024-11-09 02:13:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058134017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:13:51,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:13:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:13:51,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831971884] [2024-11-09 02:13:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:13:51,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:13:51,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:13:51,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:13:51,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:13:51,213 INFO L87 Difference]: Start difference. First operand 415 states and 587 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:13:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:13:52,597 INFO L93 Difference]: Finished difference Result 751 states and 1068 transitions. [2024-11-09 02:13:52,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 02:13:52,597 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-11-09 02:13:52,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:13:52,603 INFO L225 Difference]: With dead ends: 751 [2024-11-09 02:13:52,603 INFO L226 Difference]: Without dead ends: 430 [2024-11-09 02:13:52,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2024-11-09 02:13:52,604 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 112 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:13:52,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 707 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:13:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2024-11-09 02:13:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 411. [2024-11-09 02:13:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 361 states have (on average 1.365650969529086) internal successors, (493), 362 states have internal predecessors, (493), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-09 02:13:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 579 transitions. [2024-11-09 02:13:52,692 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 579 transitions. Word has length 118 [2024-11-09 02:13:52,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:13:52,692 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 579 transitions. [2024-11-09 02:13:52,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 02:13:52,693 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 579 transitions. [2024-11-09 02:13:52,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:13:52,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:13:52,694 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:13:52,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:13:52,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:13:52,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:13:52,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1859048456, now seen corresponding path program 1 times [2024-11-09 02:13:52,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:13:52,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195294720] [2024-11-09 02:13:52,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:52,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:13:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 02:13:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081807525] [2024-11-09 02:13:52,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:13:52,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:13:52,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:52,786 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-09 02:13:52,788 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-09 02:13:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:53,595 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:13:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:13:54,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:13:54,077 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:13:54,078 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:13:54,092 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-09 02:13:54,283 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,SelfDestructingSolverStorable8 [2024-11-09 02:13:54,287 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:13:54,417 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:13:54,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:13:54 BoogieIcfgContainer [2024-11-09 02:13:54,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:13:54,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:13:54,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:13:54,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:13:54,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:13:28" (3/4) ... [2024-11-09 02:13:54,423 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:13:54,424 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:13:54,425 INFO L158 Benchmark]: Toolchain (without parser) took 27397.99ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 100.9MB in the beginning and 340.8MB in the end (delta: -239.9MB). Peak memory consumption was 196.2MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,425 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:13:54,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 440.97ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 84.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,425 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.98ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 80.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,426 INFO L158 Benchmark]: Boogie Preprocessor took 80.16ms. Allocated memory is still 157.3MB. Free memory was 80.8MB in the beginning and 77.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,426 INFO L158 Benchmark]: RCFGBuilder took 841.66ms. Allocated memory is still 157.3MB. Free memory was 77.8MB in the beginning and 108.6MB in the end (delta: -30.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,426 INFO L158 Benchmark]: TraceAbstraction took 25956.70ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 108.0MB in the beginning and 341.8MB in the end (delta: -233.8MB). Peak memory consumption was 200.4MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,427 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 589.3MB. Free memory was 341.8MB in the beginning and 340.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 02:13:54,428 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 440.97ms. Allocated memory is still 157.3MB. Free memory was 100.4MB in the beginning and 84.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.98ms. Allocated memory is still 157.3MB. Free memory was 84.1MB in the beginning and 80.8MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.16ms. Allocated memory is still 157.3MB. Free memory was 80.8MB in the beginning and 77.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 841.66ms. Allocated memory is still 157.3MB. Free memory was 77.8MB in the beginning and 108.6MB in the end (delta: -30.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 25956.70ms. Allocated memory was 157.3MB in the beginning and 589.3MB in the end (delta: 432.0MB). Free memory was 108.0MB in the beginning and 341.8MB in the end (delta: -233.8MB). Peak memory consumption was 200.4MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 589.3MB. Free memory was 341.8MB in the beginning and 340.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L35] unsigned char isInitial = 0; [L36-L48] struct WrapperStruct00 WrapperStruct00 = { 1, 31.75, -8, 0, 0, 1, 1, -4, 32, -25, 4 }; [L49] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L50] double* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L51] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L52] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L53] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L54] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L55] unsigned char* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L56] signed short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L57] signed short int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L58] signed char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L59] signed char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L60] unsigned char last_1_WrapperStruct00_var_1_1 = 1; [L61] signed short int last_1_WrapperStruct00_var_1_10 = -4; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=0, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L123] EXPR WrapperStruct00.var_1_1 [L123] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L124] EXPR WrapperStruct00.var_1_10 [L124] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L134] RET updateLastVariables() [L135] CALL updateVariables() [L100] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_2 [L101] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_2 [L101] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L103] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_4 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L106] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L109] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L112] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L115] WrapperStruct00.var_1_12 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 32766) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L118] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L119] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L135] RET updateVariables() [L136] CALL step() [L65] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L65] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L65] COND FALSE !(last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L70] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L70] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L70] signed long int stepLocal_1 = ((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))); [L71] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L71] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-26] [L72] COND TRUE (- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75 [L73] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_0=0, stepLocal_1=-26] [L73] COND TRUE stepLocal_0 >= (*(WrapperStruct00_var_1_13_Pointer)) [L74] COND TRUE stepLocal_1 > -32 [L75] (*(WrapperStruct00_var_1_1_Pointer)) = 0 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] signed char stepLocal_2 = (*(WrapperStruct00_var_1_13_Pointer)); [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] EXPR (*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1, stepLocal_2=-25] [L90] COND TRUE (((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < stepLocal_2 [L91] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L91] (*(WrapperStruct00_var_1_10_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - 256) [L95] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L95] COND FALSE !(1 == (*(WrapperStruct00_var_1_4_Pointer))) [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR ((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) [L127] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L127] EXPR ((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR (((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR ((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127] EXPR (((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) ? (last_1_WrapperStruct00_var_1_1 ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L127-L128] return (((((- (*(WrapperStruct00_var_1_2_Pointer))) >= 16.75) ? ((((*(WrapperStruct00_var_1_13_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer))) >= (*(WrapperStruct00_var_1_13_Pointer))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) < ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))) > -32) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 0)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) ((*(WrapperStruct00_var_1_6_Pointer)) || (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1)) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) 1))) && ((1 == (*(WrapperStruct00_var_1_4_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_9_Pointer)))) : 1)) && (((((*(WrapperStruct00_var_1_13_Pointer)) | (*(WrapperStruct00_var_1_13_Pointer))) + (*(WrapperStruct00_var_1_4_Pointer))) < (*(WrapperStruct00_var_1_13_Pointer))) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) ((*(WrapperStruct00_var_1_12_Pointer)) - 256))) : ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed short int) 128)))) && ((last_1_WrapperStruct00_var_1_10 <= ((*(WrapperStruct00_var_1_12_Pointer)) / (*(WrapperStruct00_var_1_4_Pointer)))) ? (last_1_WrapperStruct00_var_1_1 ? ((*(WrapperStruct00_var_1_13_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_16_Pointer)))) : 1) : 1) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:14}, WrapperStruct00_var_1_12_Pointer={4:16}, WrapperStruct00_var_1_13_Pointer={4:18}, WrapperStruct00_var_1_16_Pointer={4:19}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:9}, WrapperStruct00_var_1_6_Pointer={4:10}, WrapperStruct00_var_1_7_Pointer={4:11}, WrapperStruct00_var_1_8_Pointer={4:12}, WrapperStruct00_var_1_9_Pointer={4:13}, isInitial=1, last_1_WrapperStruct00_var_1_10=-4, last_1_WrapperStruct00_var_1_1=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.8s, OverallIterations: 9, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 26 mSolverCounterUnknown, 1305 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1305 mSDsluCounter, 4562 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3691 mSDsCounter, 137 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4039 IncrementalHoareTripleChecker+Invalid, 4202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 137 mSolverCounterUnsat, 871 mSDtfsCounter, 4039 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 453 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=415occurred in iteration=7, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 366 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 1290 NumberOfCodeBlocks, 1290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 928 ConstructedInterpolants, 1 QuantifiedInterpolants, 21055 SizeOfPredicates, 9 NumberOfNonLiveVariables, 461 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2772/2912 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-09 02:13:54,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.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 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:13:56,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:13:56,780 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:13:56,787 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:13:56,788 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:13:56,820 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:13:56,821 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:13:56,822 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:13:56,823 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:13:56,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:13:56,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:13:56,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:13:56,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:13:56,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:13:56,826 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:13:56,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:13:56,830 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:13:56,830 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:13:56,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:13:56,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:13:56,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:13:56,832 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:13:56,832 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:13:56,832 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:13:56,832 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:13:56,833 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:13:56,833 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:13:56,833 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:13:56,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:13:56,834 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:13:56,834 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:13:56,834 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:13:56,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:13:56,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:13:56,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:56,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:13:56,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:13:56,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:13:56,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:13:56,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:13:56,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:13:56,838 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:13:56,838 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:13:56,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:13:56,839 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 -> 7c4345916100262b1cd0b4113b1b59f756ce5dadf9baff813b439bdf5b914ae7 [2024-11-09 02:13:57,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:13:57,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:13:57,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:13:57,189 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:13:57,189 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:13:57,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:13:58,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:13:58,937 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:13:58,937 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:13:58,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6291169e8/4917bb825e024f1daaf0b263632b3c9c/FLAGe90dc976a [2024-11-09 02:13:58,965 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6291169e8/4917bb825e024f1daaf0b263632b3c9c [2024-11-09 02:13:58,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:13:58,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:13:58,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:58,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:13:58,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:13:58,978 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:58" (1/1) ... [2024-11-09 02:13:58,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e6a43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:58, skipping insertion in model container [2024-11-09 02:13:58,981 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:13:58" (1/1) ... [2024-11-09 02:13:59,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:13:59,202 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_variablewrapping_wrapper-sp_file-46.i[917,930] [2024-11-09 02:13:59,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:59,300 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:13:59,312 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_variablewrapping_wrapper-sp_file-46.i[917,930] [2024-11-09 02:13:59,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:13:59,386 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:13:59,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59 WrapperNode [2024-11-09 02:13:59,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:13:59,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:59,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:13:59,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:13:59,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,451 INFO L138 Inliner]: procedures = 34, calls = 127, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 387 [2024-11-09 02:13:59,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:13:59,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:13:59,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:13:59,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:13:59,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,495 INFO L175 MemorySlicer]: Split 102 memory accesses to 2 slices as follows [2, 100]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 28 writes are split as follows [0, 28]. [2024-11-09 02:13:59,496 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,496 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,521 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,535 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,538 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,542 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:13:59,543 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:13:59,543 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:13:59,543 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:13:59,544 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (1/1) ... [2024-11-09 02:13:59,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:13:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:13:59,579 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-09 02:13:59,590 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-09 02:13:59,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:13:59,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:13:59,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:13:59,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:13:59,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:13:59,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:13:59,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:13:59,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:13:59,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:13:59,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:13:59,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:13:59,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:13:59,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:13:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:13:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:13:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:13:59,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:13:59,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:13:59,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:14:00,615 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 02:14:00,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:14:00,629 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:14:00,629 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:14:00,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:00 BoogieIcfgContainer [2024-11-09 02:14:00,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:14:00,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:14:00,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:14:00,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:14:00,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:13:58" (1/3) ... [2024-11-09 02:14:00,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66832461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:00, skipping insertion in model container [2024-11-09 02:14:00,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:13:59" (2/3) ... [2024-11-09 02:14:00,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66832461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:14:00, skipping insertion in model container [2024-11-09 02:14:00,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:14:00" (3/3) ... [2024-11-09 02:14:00,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-46.i [2024-11-09 02:14:00,654 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:14:00,654 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:14:00,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:14:00,733 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;@2f5b7526, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:14:00,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:14:00,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:14:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:14:00,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:00,756 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:14:00,757 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:00,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:00,764 INFO L85 PathProgramCache]: Analyzing trace with hash -644425847, now seen corresponding path program 1 times [2024-11-09 02:14:00,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:00,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608928667] [2024-11-09 02:14:00,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:00,780 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-09 02:14:00,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:00,784 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-09 02:14:00,786 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-09 02:14:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:01,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:14:01,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-11-09 02:14:01,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:01,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:01,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608928667] [2024-11-09 02:14:01,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608928667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:01,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:14:01,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:14:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696940249] [2024-11-09 02:14:01,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:01,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:14:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:01,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:14:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:14:01,197 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:14:01,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:01,232 INFO L93 Difference]: Finished difference Result 179 states and 278 transitions. [2024-11-09 02:14:01,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:14:01,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-11-09 02:14:01,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:01,243 INFO L225 Difference]: With dead ends: 179 [2024-11-09 02:14:01,244 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 02:14:01,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 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-09 02:14:01,253 INFO L432 NwaCegarLoop]: 128 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, 128 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-09 02:14:01,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:14:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 02:14:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 02:14:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.36986301369863) internal successors, (100), 73 states have internal predecessors, (100), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:14:01,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 128 transitions. [2024-11-09 02:14:01,314 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 128 transitions. Word has length 114 [2024-11-09 02:14:01,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:01,316 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 128 transitions. [2024-11-09 02:14:01,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 02:14:01,316 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 128 transitions. [2024-11-09 02:14:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 02:14:01,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:01,321 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:14:01,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:01,521 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-09 02:14:01,522 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:01,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash -658063507, now seen corresponding path program 1 times [2024-11-09 02:14:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741938355] [2024-11-09 02:14:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:01,524 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-09 02:14:01,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:01,527 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-09 02:14:01,528 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-09 02:14:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:01,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-09 02:14:01,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:02,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:02,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:02,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:02,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 39 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 25 [2024-11-09 02:14:02,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-09 02:14:04,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-09 02:14:06,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2024-11-09 02:14:06,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2024-11-09 02:14:07,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2024-11-09 02:14:08,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2024-11-09 02:14:08,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2024-11-09 02:14:09,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 93 [2024-11-09 02:14:09,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:09,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 112 treesize of output 56 [2024-11-09 02:14:09,837 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 60 proven. 224 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-09 02:14:09,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:11,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:11,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741938355] [2024-11-09 02:14:11,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741938355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:11,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1225457222] [2024-11-09 02:14:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:14:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:14:11,361 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:14:11,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 02:14:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:12,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 02:14:12,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 02:14:14,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 02:14:14,142 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2024-11-09 02:14:14,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 47 [2024-11-09 02:14:14,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-11-09 02:14:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-09 02:14:14,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:14:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1225457222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:14:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 02:14:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2024-11-09 02:14:14,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673549124] [2024-11-09 02:14:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:14:14,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:14:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:14:14,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:14:14,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=474, Unknown=1, NotChecked=0, Total=552 [2024-11-09 02:14:14,379 INFO L87 Difference]: Start difference. First operand 89 states and 128 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:14:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:14:15,780 INFO L93 Difference]: Finished difference Result 286 states and 409 transitions. [2024-11-09 02:14:15,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:14:15,781 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-11-09 02:14:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:14:15,783 INFO L225 Difference]: With dead ends: 286 [2024-11-09 02:14:15,783 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 02:14:15,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=137, Invalid=854, Unknown=1, NotChecked=0, Total=992 [2024-11-09 02:14:15,785 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 354 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:14:15,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 490 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 02:14:15,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 02:14:15,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 97. [2024-11-09 02:14:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:14:15,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-09 02:14:15,801 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 114 [2024-11-09 02:14:15,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:14:15,802 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-09 02:14:15,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-09 02:14:15,803 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-09 02:14:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:14:15,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:14:15,806 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:14:15,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 02:14:16,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 02:14:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 02:14:16,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:14:16,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:14:16,208 INFO L85 PathProgramCache]: Analyzing trace with hash -534956456, now seen corresponding path program 1 times [2024-11-09 02:14:16,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:14:16,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1284442853] [2024-11-09 02:14:16,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:16,210 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-09 02:14:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:14:16,212 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 02:14:16,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 02:14:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:16,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 02:14:16,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:16,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:16,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 42 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 41 [2024-11-09 02:14:16,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2024-11-09 02:14:19,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 78 [2024-11-09 02:14:20,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 71 [2024-11-09 02:14:24,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 68 [2024-11-09 02:14:28,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 67 [2024-11-09 02:14:28,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2024-11-09 02:14:32,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64 [2024-11-09 02:14:33,571 INFO L349 Elim1Store]: treesize reduction 103, result has 12.7 percent of original size [2024-11-09 02:14:33,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 105 [2024-11-09 02:14:33,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:14:33,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 102 treesize of output 54 [2024-11-09 02:14:33,742 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 304 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-09 02:14:33,742 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:14:34,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:14:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1284442853] [2024-11-09 02:14:34,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1284442853] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:14:34,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [716155520] [2024-11-09 02:14:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:14:34,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:14:34,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:14:34,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:14:34,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-09 02:14:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:14:35,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 02:14:35,106 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:14:35,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:14:35,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 37 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 17 [2024-11-09 02:14:35,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-09 02:14:35,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2024-11-09 02:14:36,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2024-11-09 02:14:37,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 53 [2024-11-09 02:14:37,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 64