/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.trace.refinement.strategy BADGER -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk30/05-lval_ls_14-idxunknown_access.line190.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.por-optimizations-e57bdd3-m [2022-10-24 21:23:17,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-24 21:23:17,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-24 21:23:17,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-24 21:23:17,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-24 21:23:17,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-24 21:23:17,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-24 21:23:17,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-24 21:23:17,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-24 21:23:17,455 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-24 21:23:17,456 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-24 21:23:17,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-24 21:23:17,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-24 21:23:17,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-24 21:23:17,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-24 21:23:17,459 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-24 21:23:17,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-24 21:23:17,460 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-24 21:23:17,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-24 21:23:17,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-24 21:23:17,464 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-24 21:23:17,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-24 21:23:17,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-24 21:23:17,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-24 21:23:17,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-24 21:23:17,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-24 21:23:17,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-24 21:23:17,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-24 21:23:17,469 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-24 21:23:17,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-24 21:23:17,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-24 21:23:17,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-24 21:23:17,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-24 21:23:17,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-24 21:23:17,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-24 21:23:17,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-24 21:23:17,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-24 21:23:17,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-24 21:23:17,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-24 21:23:17,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-24 21:23:17,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-24 21:23:17,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep-VarAbsGlobalSyntactic.epf [2022-10-24 21:23:17,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-24 21:23:17,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-24 21:23:17,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-24 21:23:17,503 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-24 21:23:17,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-24 21:23:17,504 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-24 21:23:17,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-24 21:23:17,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * Use SBE=true [2022-10-24 21:23:17,505 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-24 21:23:17,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-24 21:23:17,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-24 21:23:17,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-24 21:23:17,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-24 21:23:17,507 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2022-10-24 21:23:17,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-10-24 21:23:17,509 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> BADGER [2022-10-24 21:23:17,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-24 21:23:17,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-24 21:23:17,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-24 21:23:17,776 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2022-10-24 21:23:17,777 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2022-10-24 21:23:17,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk30/05-lval_ls_14-idxunknown_access.line190.bpl [2022-10-24 21:23:17,778 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/boogie-benchmarks-from-svcomp-memsafety-concurrent/chunk30/05-lval_ls_14-idxunknown_access.line190.bpl' [2022-10-24 21:23:17,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-24 21:23:17,816 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-10-24 21:23:17,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-24 21:23:17,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-24 21:23:17,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-24 21:23:17,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,850 INFO L138 Inliner]: procedures = 2, calls = 1, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2022-10-24 21:23:17,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-24 21:23:17,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-24 21:23:17,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-24 21:23:17,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-24 21:23:17,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-24 21:23:17,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-24 21:23:17,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-24 21:23:17,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-24 21:23:17,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/1) ... [2022-10-24 21:23:17,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-24 21:23:17,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-24 21:23:17,908 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-24 21:23:17,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-24 21:23:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-24 21:23:17,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-24 21:23:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-10-24 21:23:17,936 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-10-24 21:23:17,936 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-24 21:23:18,017 INFO L234 CfgBuilder]: Building ICFG [2022-10-24 21:23:18,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-24 21:23:18,181 INFO L275 CfgBuilder]: Performing block encoding [2022-10-24 21:23:18,188 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-24 21:23:18,188 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-24 21:23:18,190 INFO L202 PluginConnector]: Adding new model 05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:23:18 BoogieIcfgContainer [2022-10-24 21:23:18,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-24 21:23:18,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-24 21:23:18,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-24 21:23:18,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-24 21:23:18,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.10 09:23:17" (1/2) ... [2022-10-24 21:23:18,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137902fe and model type 05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:23:18, skipping insertion in model container [2022-10-24 21:23:18,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:23:18" (2/2) ... [2022-10-24 21:23:18,195 INFO L112 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_14-idxunknown_access.line190.bpl [2022-10-24 21:23:18,201 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-24 21:23:18,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-24 21:23:18,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-24 21:23:18,207 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-24 21:23:18,246 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-24 21:23:18,275 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-24 21:23:18,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-24 21:23:18,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-24 21:23:18,292 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-24 21:23:18,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-10-24 21:23:18,328 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-24 21:23:18,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2022-10-24 21:23:18,347 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2362aaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-24 21:23:18,347 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-24 21:23:18,403 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2022-10-24 21:23:18,407 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-24 21:23:18,409 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/3) [2022-10-24 21:23:18,423 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-24 21:23:18,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-24 21:23:18,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-24 21:23:18,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-24 21:23:18,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2022-10-24 21:23:18,457 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-24 21:23:18,457 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr0ASSERT_VIOLATIONASSERT ======== [2022-10-24 21:23:18,458 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2362aaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-24 21:23:18,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-24 21:23:18,458 WARN L124 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2022-10-24 21:23:18,458 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-24 21:23:18,459 INFO L444 BasicCegarLoop]: Path program histogram: [] [2022-10-24 21:23:18,459 INFO L307 ceAbstractionStarter]: Result for error location t_funErr0ASSERT_VIOLATIONASSERT was SAFE (2/3) [2022-10-24 21:23:18,461 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-10-24 21:23:18,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-10-24 21:23:18,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-24 21:23:18,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-10-24 21:23:18,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2022-10-24 21:23:18,474 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-10-24 21:23:18,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr0ASSERT_VIOLATIONASSERT ======== [2022-10-24 21:23:18,475 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@2362aaf9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-24 21:23:18,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-24 21:23:18,573 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONASSERT === [t_funErr0ASSERT_VIOLATIONASSERT] === [2022-10-24 21:23:18,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-24 21:23:18,576 INFO L85 PathProgramCache]: Analyzing trace with hash 255873773, now seen corresponding path program 1 times [2022-10-24 21:23:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-24 21:23:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040250724] [2022-10-24 21:23:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-24 21:23:18,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-24 21:23:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-24 21:23:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-24 21:23:18,697 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-24 21:23:18,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040250724] [2022-10-24 21:23:18,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040250724] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-24 21:23:18,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-24 21:23:18,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-24 21:23:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204949481] [2022-10-24 21:23:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-24 21:23:18,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-10-24 21:23:18,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-24 21:23:18,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-10-24 21:23:18,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-10-24 21:23:18,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:18,718 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-24 21:23:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-24 21:23:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:18,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-24 21:23:18,738 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONASSERT === [t_funErr0ASSERT_VIOLATIONASSERT] === [2022-10-24 21:23:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-24 21:23:18,739 INFO L85 PathProgramCache]: Analyzing trace with hash 317895864, now seen corresponding path program 1 times [2022-10-24 21:23:18,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-24 21:23:18,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378233416] [2022-10-24 21:23:18,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-24 21:23:18,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-24 21:23:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-24 21:23:19,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-24 21:23:19,029 INFO L136 FreeRefinementEngine]: Strategy BADGER found an infeasible trace [2022-10-24 21:23:19,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378233416] [2022-10-24 21:23:19,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378233416] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-24 21:23:19,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-24 21:23:19,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-10-24 21:23:19,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108721183] [2022-10-24 21:23:19,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-24 21:23:19,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-24 21:23:19,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy BADGER [2022-10-24 21:23:19,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-24 21:23:19,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-24 21:23:19,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:19,031 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-10-24 21:23:19,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-24 21:23:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:19,031 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-10-24 21:23:19,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-24 21:23:19,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-24 21:23:19,183 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONASSERT === [t_funErr0ASSERT_VIOLATIONASSERT] === [2022-10-24 21:23:19,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-24 21:23:19,183 INFO L85 PathProgramCache]: Analyzing trace with hash -753390349, now seen corresponding path program 1 times [2022-10-24 21:23:19,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy BADGER [2022-10-24 21:23:19,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212883462] [2022-10-24 21:23:19,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-24 21:23:19,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-24 21:23:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-24 21:23:19,239 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-24 21:23:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-24 21:23:19,308 INFO L130 FreeRefinementEngine]: Strategy BADGER found a feasible trace [2022-10-24 21:23:19,308 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-24 21:23:19,308 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONASSERT (0 of 1 remaining) [2022-10-24 21:23:19,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-24 21:23:19,309 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-10-24 21:23:19,309 INFO L307 ceAbstractionStarter]: Result for error location t_funErr0ASSERT_VIOLATIONASSERT was UNSAFE (3/3) [2022-10-24 21:23:19,312 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-24 21:23:19,312 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-24 21:23:19,336 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,337 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,338 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,339 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,340 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,341 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,342 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,343 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,344 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,345 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,346 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,347 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,348 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,349 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,350 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled [2022-10-24 21:23:19,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,351 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled [2022-10-24 21:23:19,373 INFO L202 PluginConnector]: Adding new model 05-lval_ls_14-idxunknown_access.line190.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:23:19 BasicIcfg [2022-10-24 21:23:19,374 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-24 21:23:19,374 INFO L158 Benchmark]: Toolchain (without parser) took 1557.84ms. Allocated memory is still 169.9MB. Free memory was 149.2MB in the beginning and 94.9MB in the end (delta: 54.3MB). Peak memory consumption was 55.2MB. Max. memory is 8.0GB. [2022-10-24 21:23:19,374 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-24 21:23:19,374 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.13ms. Allocated memory is still 169.9MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-24 21:23:19,375 INFO L158 Benchmark]: Boogie Preprocessor took 29.17ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 146.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-10-24 21:23:19,375 INFO L158 Benchmark]: RCFGBuilder took 307.85ms. Allocated memory is still 169.9MB. Free memory was 146.3MB in the beginning and 132.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-10-24 21:23:19,375 INFO L158 Benchmark]: TraceAbstraction took 1182.37ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 94.9MB in the end (delta: 37.1MB). Peak memory consumption was 38.5MB. Max. memory is 8.0GB. [2022-10-24 21:23:19,376 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 169.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.13ms. Allocated memory is still 169.9MB. Free memory was 149.2MB in the beginning and 147.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.17ms. Allocated memory is still 169.9MB. Free memory was 147.6MB in the beginning and 146.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 307.85ms. Allocated memory is still 169.9MB. Free memory was 146.3MB in the beginning and 132.9MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1182.37ms. Allocated memory is still 169.9MB. Free memory was 132.0MB in the beginning and 94.9MB in the end (delta: 37.1MB). Peak memory consumption was 38.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList ULTIMATE.dealloc_~addr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.allocOnStack_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 0, Statistics for Abstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 6, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 67, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 1, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 67, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Independence queries for same thread: 2, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 56, positive: 53, positive conditional: 53, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 67, positive: 62, positive conditional: 62, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 56, positive conditional: 0, positive unconditional: 56, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 58, unknown conditional: 0, unknown unconditional: 58] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Independence queries for same thread: 3, Statistics for Abstraction: - CounterExampleResult [Line: 190]: assertion can be violated assertion can be violated We found a FailurePath: [L240] 0 assume { :begin_inline_ULTIMATE.init } true; [L241] 0 #NULL := { base: 0, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0] [L242] 0 assume 0 == #valid[0]; VAL [#NULL!base=0, #NULL!offset=0] [L243] 0 assume 0 < #StackHeapBarrier; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1] [L244] 0 ~#data~0 := { base: 1, offset: 0 }; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, ~#data~0!base=1, ~#data~0!offset=0] [L245] 0 assume { :begin_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, ~#data~0!base=1, ~#data~0!offset=0] [L246] 0 #Ultimate.allocInit_~size#1, #Ultimate.allocInit_ptrBase#1 := 40, 1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L247] 0 assume 1 == #valid[#Ultimate.allocInit_ptrBase#1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L248] 0 assume #length[#Ultimate.allocInit_ptrBase#1] == #Ultimate.allocInit_~size#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L249] 0 assume { :end_inline_#Ultimate.allocInit } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L250] 0 #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#data~0!base); VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L252] 0 assume { :end_inline_ULTIMATE.init } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L253] 0 assume { :begin_inline_main } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L254] 0 havoc main_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L255] 0 havoc main_#t~nondet4#1, main_#t~pre5#1, main_#t~nondet6#1, main_#t~mem7#1, main_#t~post8#1, main_~i~0#1, main_~#id~0#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, ~#data~0!base=1, ~#data~0!offset=0] [L256] 0 assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, main_#t~nondet4#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L257] 0 main_~i~0#1 := main_#t~nondet4#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, main_#t~nondet4#1=9, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L258] 0 havoc main_#t~nondet4#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L259] 0 assume { :begin_inline_assume_abort_if_not } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L260] 0 assume_abort_if_not_#in~cond#1 := (if 0 <= main_~i~0#1 && main_~i~0#1 < 10 then 1 else 0); VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L261] 0 havoc assume_abort_if_not_~cond#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L262] 0 assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L263] COND FALSE 0 !(0 == assume_abort_if_not_~cond#1) VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L267] 0 assume { :end_inline_assume_abort_if_not } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L268] 0 #Ultimate.allocOnStack_old_#length#1, #Ultimate.allocOnStack_old_#valid#1 := #length, #valid; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L269] 0 assume { :begin_inline_#Ultimate.allocOnStack } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L270] 0 #Ultimate.allocOnStack_~size#1 := 4; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L271] 0 havoc #Ultimate.allocOnStack_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L272] 0 havoc #valid, #length; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L273] 0 assume 0 == #Ultimate.allocOnStack_old_#valid#1[#Ultimate.allocOnStack_#res#1!base]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L274] 0 assume #valid == #Ultimate.allocOnStack_old_#valid#1[#Ultimate.allocOnStack_#res#1!base := 1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L275] 0 assume 0 == #Ultimate.allocOnStack_#res#1!offset; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L276] 0 assume 0 != #Ultimate.allocOnStack_#res#1!base; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L277] 0 assume #StackHeapBarrier < #Ultimate.allocOnStack_#res#1!base; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L278] 0 assume #length == #Ultimate.allocOnStack_old_#length#1[#Ultimate.allocOnStack_#res#1!base := #Ultimate.allocOnStack_~size#1]; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L279] 0 main_~#id~0#1 := #Ultimate.allocOnStack_#res#1; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L280] 0 assume { :end_inline_#Ultimate.allocOnStack } true; VAL [#NULL!base=0, #NULL!offset=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L281] 0 main_#t~pre5#1 := #pthreadsForks; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=-1, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L282] 0 #pthreadsForks := 1 + #pthreadsForks; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L283] 0 write~int_old_#memory_int#1 := #memory_int; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L284] 0 assume { :begin_inline_write~int } true; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, ~#data~0!base=1, ~#data~0!offset=0] [L285] 0 write~int_#value#1, write~int_#ptr#1, write~int_#sizeOfWrittenType#1 := main_#t~pre5#1, main_~#id~0#1, 4; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L288] 0 assume 1 == #valid[write~int_#ptr#1!base]; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L289] 0 assume write~int_#sizeOfWrittenType#1 + write~int_#ptr#1!offset <= #length[write~int_#ptr#1!base] && 0 <= write~int_#ptr#1!offset; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L290] 0 havoc #memory_int; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L291] 0 assume #memory_int == write~int_old_#memory_int#1[write~int_#ptr#1 := write~int_#value#1]; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L292] 0 assume { :end_inline_write~int } true; VAL [#NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L293] FORK 0 fork main_#t~pre5#1, 0 t_fun({ base: 0, offset: 0 }); VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0] [L187] 1 ~arg#1 := #in~arg#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L188] 1 assume { :begin_inline_read~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L189] 1 read~int_#ptr#1, read~int_#sizeOfReadType#1 := { base: ~#data~0!base, offset: 16 + ~#data~0!offset }, 4; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~pre5#1=-1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L294] 0 havoc main_#t~pre5#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L295] 0 havoc main_#t~nondet6#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L296] 0 assume { :begin_inline_read~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L297] 0 read~int_#ptr#1, read~int_#sizeOfReadType#1 := { base: ~#data~0!base, offset: ~#data~0!offset + 4 * main_~i~0#1 }, 4; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L300] 0 assume 1 == #valid[read~int_#ptr#1!base]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L301] 0 assume read~int_#sizeOfReadType#1 + read~int_#ptr#1!offset <= #length[read~int_#ptr#1!base] && 0 <= read~int_#ptr#1!offset; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L302] 0 havoc read~int_#value#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L303] 0 assume read~int_#value#1 == #memory_int[read~int_#ptr#1]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L304] 0 main_#t~mem7#1 := read~int_#value#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L305] 0 assume { :end_inline_read~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L306] 0 main_#t~post8#1 := main_#t~mem7#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L307] 0 write~int_old_#memory_int#1 := #memory_int; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L308] 0 assume { :begin_inline_write~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=2, write~int_#ptr#1!offset=0, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=-1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L309] 0 write~int_#value#1, write~int_#ptr#1, write~int_#sizeOfWrittenType#1 := 1 + main_#t~post8#1, { base: ~#data~0!base, offset: ~#data~0!offset + 4 * main_~i~0#1 }, 4; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L312] 0 assume 1 == #valid[write~int_#ptr#1!base]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L313] 0 assume write~int_#sizeOfWrittenType#1 + write~int_#ptr#1!offset <= #length[write~int_#ptr#1!base] && 0 <= write~int_#ptr#1!offset; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L314] 0 havoc #memory_int; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L315] 0 assume #memory_int == write~int_old_#memory_int#1[write~int_#ptr#1 := write~int_#value#1]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L316] 0 assume { :end_inline_write~int } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~mem7#1=0, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L317] 0 havoc main_#t~mem7#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#t~post8#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L318] 0 havoc main_#t~post8#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L319] 0 main_#res#1 := 0; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L320] 0 ULTIMATE.dealloc_old_#valid#1 := #valid; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L321] 0 assume { :begin_inline_ULTIMATE.dealloc } true; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L322] 0 ULTIMATE.dealloc_~addr#1 := main_~#id~0#1; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=16, read~int_#ptr#1!offset=36, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, ULTIMATE.dealloc_~addr#1.base=2, ULTIMATE.dealloc_~addr#1.offset=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L323] 0 havoc #valid; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, ULTIMATE.dealloc_~addr#1.base=2, ULTIMATE.dealloc_~addr#1.offset=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] [L190] 1 assert 1 == #valid[read~int_#ptr#1!base]; VAL [#in~arg#1!base=0, #in~arg#1!offset=0, #NULL!base=0, #NULL!offset=0, #pthreadsForks=0, #StackHeapBarrier=1, #Ultimate.allocInit_ptrBase#1=1, #Ultimate.allocInit_~size#1=40, #Ultimate.allocOnStack_#res#1.base=2, #Ultimate.allocOnStack_#res#1.offset=0, #Ultimate.allocOnStack_~size#1=4, assume_abort_if_not_#in~cond#1=1, assume_abort_if_not_~cond#1=1, main_#res#1=0, main_~#id~0#1!base=2, main_~#id~0#1!offset=0, main_~i~0#1=9, read~int_#ptr#1!base=1, read~int_#ptr#1!base=1, read~int_#ptr#1!offset=36, read~int_#ptr#1!offset=16, read~int_#sizeOfReadType#1=4, read~int_#sizeOfReadType#1=4, read~int_#value#1=0, ULTIMATE.dealloc_~addr#1.base=2, ULTIMATE.dealloc_~addr#1.offset=0, write~int_#ptr#1!base=1, write~int_#ptr#1!offset=36, write~int_#sizeOfWrittenType#1=4, write~int_#value#1=1, ~#data~0!base=1, ~#data~0!offset=0, ~arg#1!base=0, ~arg#1!offset=0] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 133 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr0ASSERT_VIOLATIONASSERT with 1 thread instances CFG has 3 procedures, 133 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr0ASSERT_VIOLATIONASSERT with 2 thread instances CFG has 3 procedures, 133 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 103 ConstructedInterpolants, 0 QuantifiedInterpolants, 417 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-10-24 21:23:19,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2022-10-24 21:23:19,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2022-10-24 21:23:19,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-10-24 21:23:20,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...